Project scheduling with limited resources using a genetic algorithm

International Journal of Project Management

Volumn 28, Issue 6, 2010, Pages 619-628

  Montoya Torres, Jairo R ^a   Gutierrez Franco, Edgar ^a,b   Pirachicán Mayorga, Carolina ^a  

^a UNIVERSIDAD DE LA SABANA   (Colombia)

^b Massachusetts Institute of Technology Cambridge   (United States)

Author keywords

Experimental analysis; Genetic algorithm; Object oriented model; Project scheduling

Indexed keywords

COMMON LANGUAGES; COMPUTATIONAL RESULTS; COMPUTATIONAL TIME; EXPERIMENTAL ANALYSIS; OBJECT ORIENTED MODEL; PROJECT SCHEDULING; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; STANDARD PROBLEMS;

ARTIFICIAL INTELLIGENCE; DECISION SUPPORT SYSTEMS; DECISION THEORY; GENETIC ALGORITHMS; PROBLEM ORIENTED LANGUAGES;

OBJECT ORIENTED PROGRAMMING;

CHROMOSOME; DECISION SUPPORT SYSTEM; EXPERIMENTAL STUDY; GENETIC ALGORITHM; NUMERICAL MODEL; PROJECT MANAGEMENT; TESTING METHOD;

EID: 77953356476     PISSN: 02637863     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijproman.2009.10.003     Document Type: Article

References (52)

1. Back T. Evolutionary Algorithms in Theory and Practice 1995, Oxford University Press, New York.
2. Blazewicz J., Lenstra J.K., Rinnooy Kan A.H.G. Scheduling subject to resource constraints: classification and complexity. Discrete Applied Mathematics 1983, 5:11-24.
3. Boctor F.F. Some efficient multi-heuristic procedures for resource-constrained project scheduling. European Journal of Operational Research 1990, 49:3-13.
4. Boctor F.F. An adaptation of the simulated annealing algorithm for solving resource-constrained project scheduling problems. International Journal of Production Research 1996, 34:2335-2351.
5. Bouleimen K., Lecocq H. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research 2003, 149:268-281.
6. Brucker P., Knust S. Lower bounds for resource-constrained project scheduling problems. European Journal of Operational Research 2003, 149:302-313.
7. Brucker P., Knust S., Schoo A., Thiele O. A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research 1998, 107:272-288.
8. Brucker P., Drexl A., Möhring R., Neumann K., Pesch E. Resource-constrained project scheduling: notation, classification, models, and methods. European Journal of Operational Research 1999, 112:3-41.
9. Cooper D.F. Heuristics for scheduling resource-constrained projects: an experimental investigation. Management Science 1976, 22:1186-1194.
10. Davis E.W., Patterson J.H. A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Management Science 1975, 21:944-955.
11. Debels D., Vanhoucke M. A decomposition-based heuristic for the resource-constrained project scheduling problem 2005, Technical Report 2005/293, Faculty of Economics and Business Administration, University of Ghent, Ghent, Belgium.
12. Demassey S., Artigues C., Michelon P. Constraint-propagation-base cutting planes: an application to the resource-constrained project scheduling problem. INFORMS Journal of Computing 2005, 17:52-65.
13. Demeulemeester E., Herroelen W. New benchmark results for the resource-constrained project scheduling problem. Management Science 1997, 43:1485-1492.
14. Flanagan, D., 2002. Java in a Nutshell, fifth ed. O'Reilly.
15. Fleszar K., Hindi K.S. Solving the resource-constrained project scheduling problem by a variable neighborhood search. European Journal of Operational Research 2004, 155:402-413.
16. Fogel, D.B., 1995. Evolutionary Computation, Towards a New Philosophy of Machine Intelligence. IEEE Press.
17. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning 1989, Addison-Wiley, Reading, USA.
18. Gutierrez-Franco, E., La Torre-Zurita, F., Mejía-Delgadillo, G., 2007. A genetic algorithm for the resource constrained project scheduling problem (RCPSP). In: Proceedings of the 19th International Conference on Production Research (ICPR-19). Valparaiso, Chile, July 29-August 2, 2007. CD-ROM.
19. Hartmann S. A competitive genetic algorithm for resource-constrained project scheduling. Naval Research Logistics 1998, 45:279-302.
20. Hartmann S. A self-adapting genetic algorithm for project scheduling under resource constraints. Naval Research Logistics 2002, 49:433-448.
21. Hartmann S., Kolisch R. Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Research 2000, 127:394-407.
22. Herroelen W., De Reyck B., Demeulemeeste E. Resource-constrained project scheduling: a survey of recent developments. Computers & Operations Research 1998, 25:279-302.
23. Icmeli O., Erenguc S.S., Zappe C.J. Project scheduling problems: a survey. International Journal of Operations & Production Management 1993, 13:80-91.
24. Kim K.W., Mitsuo G., Yamazaki G. Hybrid genetic algorithm with fuzzy logic for resource-constrained project scheduling. Applied Soft Computing 2003, 2:174-188.
25. Klein R. Scheduling of resource-constrained projects 1999, Kluwer Academic Publishers, Dordrecht.
26. Klein R., Scholl A. Progress: optimally solving the generalized resource-constrained project scheduling problem 1998, Technical Report, University of Technology, Darmstadt.
27. Klein R., Scholl A. Scattered branch and bound: an adaptive search strategy applied to resource-constrained project scheduling problem 1998, Technical Report, University of Technology, Darmstadt.
28. Kochetov, Y., Stolyar, A., 2003. Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem. In: Proceedings of the 3rd International Workshop on Computer Science and Information Technologies.
29. Kohlmorgen U., Schmeck H., Haase K. Experiences with fine-grained parallel genetic algorithms. Annals of Operations Research 1999, 90:203-219.
30. Kolisch R. Efficient priority rules for the resource-constrained project scheduling problem. Journal of Operations Management 1996, 14:179-192.
31. Kolisch R. Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. European Journal of Operational Research 1996, 90:320-333.
32. Kolisch R., Hartmann S. Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. Handbook on Recent Advances in Project Scheduling 1999, 147-178. Kluwer Academic Publishers, Dordrecht. J. Weglarz (Ed.).
33. Kolisch R., Hartmann S. Experimental investigation of heuristics for resource-constrained project scheduling: an update. European Journal of Operational Research 2006, 174:23-37.
34. Kolisch R., Padman R. An integrated survey of deterministic project scheduling. Omega 2001, 29:249-272.
35. Lee J.K., Kim Y.D. Search heuristics for resource constrained project scheduling. Journal of the Operational Research Society 1996, 47:678-689.
36. Leon V.J., Ramamoorthy B. Strength and adaptability of problem-space based neighborhoods for resource constrained scheduling. OR Spectrum 1995, 17:173-182.
37. Manderick, B., Spiessens, P., 1989. Fine-grained parallel genetic algorithms. In: Schaffer, J.D., Kaufmann, M. (Eds.), Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 428-433.
38. Mendes J.J., Gonçalves J.F., Resende M.G.C. A random key based genetic algorithm for the resource constrained project scheduling problem. Computers & Operations Research 2009, 36:92-109.
39. Mingozzi A., Maniezzo V., Ricciardelli S., Bianco L. An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation. Management Science 1998, 44:714-729.
40. Montoya-Torres J.R. Literature review of meta-heuristic procedures for resource-constrained project scheduling problems 2009, Research Report EICEA-200906-02, School of Economics and Management Sciences, Universidad de La Sabana, Colombia.
41. Palpant M., Artigues C., Michelon P. LSSPER: solving the resource-constrained project scheduling problem with large neighborhood search. Annals of Operations Research 2004, 131:237-257.
42. Pinson, E., Prins, C., Rullier, F., 1994. Using tabu search for solving the resource constrained project scheduling problem. Technical Report, Universite Catholique de l'Ouest, Angers.
43. Sevaux M., Dauzère-Pérès S. Genetic algorithms to minimize the weighted number of late jobs on a single machine. European Journal of Operational Research 2003, 151:296-306.
44. Slowinski R., Soniewicki B., Weglarz J. DSS for multiobjective project scheduling. European Journal of Operational Research 1994, 79:220-229.
45. Sprecher A. Scheduling resource-constrained projects competitively at modest memory requirements. Management Science 2000, 46:710-723.
46. Stork F., Uetz M. On the generation of circuits and minimal forbidden sets. Mathematical Programming 2005, 102:185-203.
47. Tanese, R., 1989. Distributed genetic algorithms. In: Schaffer, J.D., Kaufmann, M. (Eds.), Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 428-433.
48. Thomas P.R., Salhi S. A tabu search approach for the resource constrained project scheduling problem. Journal of Heuristics 1998, 4:123-139.
49. Tormos P., Lova A. A competitive heuristic solution technique for resource-constrained project scheduling. Annals of Operations Research 2001, 102:65-81.
50. Tseng L.Y., Chen S.C. A hybrid metaheuristic for the resource-constrained project scheduling problem. European Journal of Operational Research 2006, 175:707-721.
51. Valls V., Ballestín F., Quintanilla S. A population-based approach for the resource-constrained project scheduling problem. Annals of Operations Research 2004, 131:305-324.
52. Valls V., Ballestín F., Quintanilla S. A hybrid genetic algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research 2008, 185:495-508.