A genetic algorithm for mode identity and the resource constrained project scheduling problem

Scientia Iranica

Volumn 20, Issue 3, 2013, Pages 824-831

  Afshar Nadjafi, Behrouz ^a   Rahimi, Amir ^a   Karimi, Hamid ^a  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

Author keywords

Genetic algorithm; Mode identity; Multi mode; Project scheduling

Indexed keywords

HEURISTIC ALGORITHMS; SCHEDULING;

META HEURISTIC ALGORITHM; MODE IDENTITY; MULTI-MODE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; MULTIMODES; PROJECT SCHEDULING; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; STATISTICAL OPTIMIZATION; TAGUCHI EXPERIMENTAL DESIGN;

GENETIC ALGORITHMS;

ALGORITHM; COMPUTER SIMULATION; EXPERIMENTAL DESIGN; GENETIC ALGORITHM; IDENTIFICATION METHOD;

EID: 84888318265     PISSN: 10263098     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scient.2012.11.011     Document Type: Article

References (27)

1. Drexl, A., Juretzka, J., Salewski, F. and Schirmer, A. New modeling concepts and their impact on resource-constrained project scheduling, In Project Scheduling-Recent Models, Algorithms and Applications, J. Weglarz, Ed., pp. 413-432, Kluwer Academic Publishers, Boston (1998)
2. Salewski, F., Schirmer, A. and Drexl, A. Project scheduling under resource and mode identity constraints, European J. Oper. Res., 102, pp. 88-110 (1997)
3. Afshar-Nadjafi, B. and Rahimi, A. An exact solution procedure for mode identity and resource constrained project scheduling problem, In Recent Researches in Applied Mathematics, N. Mastorakis, V. Mladenov, M. Demiralp and Z. Bojkovi, Eds., pp. 20-26, WSEAS Press, Athens (2010)
4. Demeulemeester, E. and Herroelen, W., Project Scheduling: A Research Handbook, Kluwer Academic Publishers, Boston (2002)
5. Hartmann, S. A competitive genetic algorithm for resource-constrained project scheduling, Naval Res. Logist., 45, pp. 733-750 (1998)
6. Ozdamar, L. A genetic algorithm approach to a general category project scheduling problem, IEEE Trans. Syst. Man Cybern. Part C Appl. Rev., 29, pp. 44-59 (1999)
7. Hartmann, S. Project scheduling with multiple modes: a genetic algorithm, Ann. Oper. Res., 102, pp. 111-135 (2001)
8. Hartmann, S. A self-adapting genetic algorithm for project scheduling under resource constraints, Naval Res. Logist., 49, pp. 433-448 (2002)
9. Alcaraz, J., Maroto, C. and Ruiz, R. Solving the multi-mode resourceconstrained project scheduling problem with genetic algorithms, J. Oper. Res. Soc., 54, pp. 614-626 (2003)
10. Elloumi, S. and Fortemps, P. A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem, European J. Oper. Res., 205, pp. 31-41 (2010)
11. Sprecher, A., Hartmann, S. and Drexl, A. An exact algorithm for project scheduling with multiple modes, OR Spektrum, 19, pp. 195-203 (1997)
12. Kolisch, R. and Hartmann, S. Heuristic algorithms for solving the resourceconstrained project scheduling problem: classification and computational analysis, In Project Scheduling: Recent Models, Algorithms and Applications, J. Weglarz, Ed., pp. 147-178, Kluwer Academic Publishers, Boston (1999).
13. Hartmann, S. and Kolisch, R. Experimental evaluation of state-of-theart heuristics for the resource-constrained project scheduling problem, European J. Oper. Res., 127, pp. 394-407 (2000)
14. Holland, H.J., Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor (1975)
15. Moscato, P. and Norman, M. A memetic approach for the traveling salesman problem: implementation of a computational ecology for combinatorial optimization on message-passing systems, The International Conference on Parallel Computing and Transputer Applications, Amsterdam (1992)
16. Wang, L. A hybrid genetic algorithm-neural network strategy for simulation optimization, Appl. Math. Comput., 170(2), pp. 1329-1343 (2005)
17. Reynolds, R.G. An introduction to cultural algorithms, The Third Annual Conference on Evolutionary Programming, Singapore, pp. 131-139 (1994)
18. Ho, N.B., Tay, J.C. and Lai, E.M.K. An effective architecture for learning and evolving flexible job-shop schedules, European J. Oper. Res., 179(2), pp. 316-333 (2007)
19. Louis, S.J. and McDonnell, J. Learning with case-injected genetic algorithms, IEEE Trans. Evol. Comput., 8(4), pp. 316-328 (2004)
20. Michalski, R.S. Learnable evolution model: evolution process guided by machine learning, Mach. Learn., 38(1), pp. 9-40 (2000)
21. Xing, L.N., Chen, Y.W., Wang, P., Zhao, Q.S. and Xiong, J. A knowledgebased ant colony optimization for flexible job shop scheduling problems, Appl. Soft Comput., 10, pp. 888-896 (2010)
22. Montgomery, D.C., Design and Analysis of Experiments, 5th Edn., Wiley, New York (2000)
23. Ruiz, R., Maroto, C. and Alcaraz, J. Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics, European J. Oper. Res., 165(1), pp. 34-54 (2005)
24. Cochran, W.G. and Cox, G.M., Experimental Designs, 2nd Edn., Wiley, New York (1992)
25. Taguchi, G., Introduction to Quality Engineering, Asian Productivity Organization, Tokyo (1986)
26. Hedayat, A.S., Sloane, N.J.A. and Stufken, J., Orthogonal Arrays: Theory and Applications, Springer-Verlag, New York (1999)
27. Drexl, A., Nissen, R., Patterson, J.H. and Salewski, F. ProGen/x-an instance generator for resource constrained project scheduling problems with partially renewable resources and further extensions, European J. Oper. Res., 125, pp. 59-72 (2000)