Two-phase genetic local search algorithm for the multimode resource-constrained project scheduling problem

IEEE Transactions on Evolutionary Computation

Volumn 13, Issue 4, 2009, Pages 848-857

  Tseng, Lin Yu ^a   Chen, Shih Chieh ^a,b  

^a NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

^b OVERSEAS CHINESE INSTITUTE OF TECHNOLOGY   (Taiwan)

Author keywords

Genetic algorithm; Local search; Multiple modes; Resource constrained project scheduling

Indexed keywords

COMPUTATIONAL EXPERIMENT; GENETIC LOCAL SEARCH ALGORITHM; INITIAL POPULATION; LOCAL SEARCH; LOCAL SEARCH METHOD; LONG TERM; MAKESPAN; MULTI-MODE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; MULTIPLE MODES; MUTATION RATES; RESOURCE CONSTRAINT; RESOURCE-CONSTRAINED PROJECT SCHEDULING; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; SECOND PHASE;

GENETIC ALGORITHMS; LEARNING ALGORITHMS; PROBLEM SOLVING; SET THEORY;

SCHEDULING ALGORITHMS;

EID: 69249164131     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2008.2011991     Document Type: Article

References (27)

1. J. Alcaraz and C. Maroto, "A robust genetic algorithm for resource allocation in project scheduling," Ann. Oper. Res., vol. 102, pp. 83-109, 2001.
2. J. Alcaraz, C. Maroto, and R. Ruiz, "Solving the multimode resource-constrained project scheduling problem with genetic algorithms," J. Oper. Res. Soc., vol. 54, pp. 614-626, 2003.
3. F. F. Boctor, "Heuristics for scheduling projects with resource restrictions and several resource-duration modes," Int. J. Prod. Res., vol. 31, pp. 2547-2558, 1993.
4. F. F. Boctor, "An adaption of the simulated annealing algorithm for solving the resource-constrained project scheduling problems," Int. J. Prod. Res., vol. 34, pp. 2335-2351, 1996.
5. F. F. Boctor, "A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes," Eur. J. Oper. Res., vol. 90, pp. 349-361, 1996.
6. K. Bouleimen and H. Lecocq, "A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version," Eur. J. Oper. Res., vol. 149, pp. 268-281, 2003.
7. B. G. W. Craenen, A. E. Eiben, and J. I. van Hemert, "Comparing evolutionary algorithms on binary constraint satisfaction problems," IEEE Trans. Evol. Comput., vol. 7, no. 5, pp. 424-445, Oct. 2003.
8. B. G. W. Craenen, A. E. Eiben, and E. Marchiori, "How to handle constraints with evolutionary algorithms," in Practical Handbook Genetic Algorithms, 2nd ed. London, U.K.: Chapmann & Hall/CRC Press, 2001, ch. 10, pp. 341-361.
9. A. Drexl and J. Grunewald, "Nonpreemptive multimode resource-constrained project scheduling," IIE Trans., vol. 25, pp. 74-81, 1993.
10. S. Hartmann, "A competitive genetic algorithm for resource-constrained project scheduling," Nav. Res. Logist., vol. 45, pp. 733-750, 1998.
11. S. Hartmann, "Project scheduling with multiple modes: A genetic algorithm," Ann. Oper. Res., vol. 102, pp. 111-135, 2001.
12. S. Hartmann and A. Drexl, "Project scheduling with multiple modes: A comparison of exact algorithm," Netw., vol. 32, pp. 733-750, 1998.
13. S. Hartmann and R. Kolisch, "Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem," Eur. J. Oper. Res., vol. 127, pp. 394-407, 2000.
14. H. Hoos and E. P. K. Tsang, "Local search for constraint satisfaction," in Handbook Constraint Programming, Amsterdam, Netherlands: Elsevier, 2006, ch. 5, pp. 245-277.
15. J. Jozefowska, M. Mika, R. Rozychi, G. Waligora, and J. Weglarz, "Simulated annealing for multimode resource-constrained project scheduling," Ann. Oper. Res., vol. 102, pp. 137-155, 2001.
16. R. Kolisch and A. Drexl, "Local search for nonpreemptive multimode resource-constrained project scheduling," IIE Trans., vol. 43, pp. 987-999, 1996.
17. R. Kolisch and S. Hartmann, "Experimental investigation of heuristics for resource-constrained project scheduling: An update," Paper, Tech. Univ. Munich, Munich, Germany. (Apr. 2004). [Online]. Available: http://halfrunt.bwl.uni-kiel.de/bwlinstitute/Prod/mab/ hartmann/hartmann.html
18. R. Kolisch and A. Sprecher, "PSPLIB a project scheduling problem library," Eur. J. Oper. Res., vol. 96, pp. 205-216, 1996.
19. T. L. Lau and E. P. K. Tsang, "The guided genetic algorithm and its application to the general assignment problem," in Proc. IEEE 10th Int. Conf. Tools with Artificial Intell., Taiwan, Nov. 1998, pp. 336-343.
20. M. Mori and C. C. Tseng, "A genetic algorithm for multimode resource constrained project scheduling problem," Eur. J. Oper. Res., vol. 100, pp. 134-141, 1997.
21. L. Özdamar, "A genetic algorithm approach to a general category project scheduling problem," IEEE Trans. Sys. Man, Cybern. Part C. vol. 29, no. 1, pp. 44-59, Feb. 1999.
22. S. Petrovic, D. Petrovic, and E. Burke, "Fuzzy logic based production scheduling and rescheduling in the presence of uncertainty," in Handbook of Production Planning, K. Kempf, P. Keskinocak, R. Uzsoy, Eds., New York: Springer-Verlag, ch. 15, to be published.
23. R. Slowinski, B. Soniewicki, and J. Weglarz, "DSS for multiobjective project scheduling subject to multiple-category resource constraints," Eur. J. Oper. Res., vol. 79, pp. 220-229, 1994.
24. A. Sprecher and A. Drexl, "Multimode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm," Eur. J. Oper. Res., vol. 107, pp. 431-450, 1998.
25. A. Sprecher, S. Hartmann, and A. Drexl, "An exact algorithm for project scheduling with multiple modes," OR Spectrum, vol. 19, pp. 195-203, 1997.
26. E. Tsang, Foundations of Constraint Satisfaction. New York: Academic Press, 1993, ch. 2, pp. 31-52.
27. L. Y. Tseng and S. C. Chen, "A hybrid metaheuristic ANGEL for the resource-constrained project scheduling problem," Eur. J. Oper. Res. vol. 175, pp. 707-721, 2006.