A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search

Applied Mathematics and Computation

Volumn 190, Issue 2, 2007, Pages 1136-1145

  Tareghian, Hamed R ^a   Taheri, Seyyed Hassan ^a,b  

^a FERDOWSI UNIVERSITY OF MASHHAD   (Iran)

^b Ferdowsi University of Mashhad   (Iran)

Author keywords

Cost and quality problem; Discrete time; Electromagnetism theory; Project management; Scatter search

Indexed keywords

ELECTROMAGNETISM; HEURISTIC ALGORITHMS; PROBLEM SOLVING; PROJECT MANAGEMENT;

COST AND QUALITY PROBLEM; ELECTROMAGNETISM THEORY; META HEURISTIC SOLUTION PROCEDURE; SCATTER SEARCH;

DISCRETE TIME CONTROL SYSTEMS;

EID: 34250621376     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2007.01.100     Document Type: Article

References (30)

1. Kelly J.E., and Walker M.R. Critical Path Planning and Scheduling: An Introduction (1959), Mauchly Associates, Ambler, PA
2. Fulkerson D.R. A network flow computation for project cost curves. Management Science 7 (1961) 167-178
3. Siemens N. A simple CPM time/cost trade-off algorithm. Management Science 17 (1971) B-354-B-363
4. Goyal S.K. A note on the paper: a simple CPM time/cost trade-off algorithm. Management Science 21 (1975) 718-722
5. S.E. Elmaghraby, A. Salem, Optimal linear approximation in project compression. O.R. Technical Report 171, North Carolina State University at Raleigh (1981).
6. Tareghian H.R., and Taheri H. An application of randomized minimum cut to the project time/cost tradeoff problem. Applied Mathematics and Computation 173 (2005) 1200-1207
7. Falk J.E., and Horowitz J.L. Critical path problems with concave cost-time curves. Management Science 19 (1972) 446-455
8. Kapur K.C. An algorithm for the project cost/ duration analysis problem with quadratic and convex cost functions. IIE Transactions 5 (1973) 314-322
9. Moder J.J., Phillips C.R., and Davis E.W. Project Management with CPM, PERT and precedence diagramming. third ed. (1983), Van Nostrand Reinhold Company
10. Prabudha D., Dunne E.J., Ghosh J.B., and Wells C.E. The discrete time-cost tradeoff problem revisited. European Journal of Operational 81 (1995) 225-238
11. Hindelang T.J., and Muth J.F. A dynamic programming algorithm for decision CPM networks. Operations Research 27 (1979) 225-241
12. Robinson D.R. A dynamic programming solution to the cost-time for CPM. Management Science 22 (1975) 158-166
13. Patterson J.H., and Harvey R.T. An implicit enumeration algorithm for the time/cost tradeoff problem in project network analysis. Foundations of Control Engineering 4 (1979) 107-117
14. Demeulemeester E., Herroelen W., and Elmaghraby S.E. Optimal procedures for the discrete time/cost trade-off problem in project networks. European Journal of Operational Research 88 (1996) 50-68
15. De P., Dunne E.J., Ghosh J.B., and Wells C.E. Complexity of the discrete time-cost tradeoff problem for project networks. Operations Research 45 (1997) 302-306
16. C. Akkan, A Lagrangian heuristic for the discrete time-cost tradeoff problem for activity-on-arc project networks. Working Paper, Koc University, Istanbul (1998).
17. Babu A.J.G., and Suresh N. Project management with time, cost and quality considerations. European Journal of Operational 88 (1996) 320-327
18. Khang D.B., and Myint Y.M. Time, cost and quality trade-off in project management: a case study. International Journal of Project Management 17 4 (1999) 249-256
19. Chu P.C., and Beasley J.E. A genetic algorithm for the generalized assignment problem. Computers and Operations Research 24 (1997) 17-23
20. M.P. Hansen, Tabu search for multiobjective optimization:Mots, in: Proceedings of the 13th International Conference on Multiple Criteria Decision Making, University of Cape Town, 1997, pp. 547-586.
21. Glover F. A template for scatter search and path relinking. In: Hao E., Lutton E., et al. (Eds). Artificial Evolution, Lecture Notes in Computer Science 1363 (1998), Springer-Verlag 13-54
22. Campos V., Glover F., Laguna M., and Marti R. An experimental evaluation of a scatter search for the linear ordering problem. Journal of Global Optimization 21 4 (2001) 397-414
23. Larranaga P., Kuijpers C.M.H., Murga R.H., Inza I., and Dizdarevic S. Genetic algorithms for the traveling salesman problem: a review of representations and operators. Artificial Intelligence 13 (1999) 129-170
24. Marti R., Laguna M., and Glover F. Principles of scatter search. European Journal of Operational Research 169 (2006) 359-372
25. Debels D., Reyck B.D., Leus R., and Vanhoucke M. A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. European Journal of Operational Research 169 2 (2006) 638-653 1 March 2006
26. Birbil S.I., and Fang S.C. An electromagnetism-like mechanism for global optimization. Journal of global optimization 25 (2003) 263-282
27. Kolisch R., Sprecher A., and Drexl A. Characterization and generation of a general class of resource-constrained project scheduling problem. Management Science 41 (1995) 1693-1703
28. Demeulemeester E., Vanhoucke M., and Herroelen W. Rangen: a random network generator for activity-on-the-node networks. Journal of Scheduling 6 (2003) 17-38
29. Agrawal M.K., Elmaghraby S.E., and Herroelen W. DAGEN: a generator of testsets for project activity nets. European Journal of Operations Research 90 (1996) 376-382
30. Tareghian H.R., and Taheri H. On the discrete time, cost and quality trade-off problem. Applied Mathematics and Computation 181 (2006) 1305-1312