A genetic algorithm for multi-mode resource constrained project scheduling problem

Abstract This article considers a general class of nonpreemptive multi-mode resource-constrained project scheduling problems in which activity durations depend on committed renewable resources (multi-mode time resource tradeoff). We propose a genetic algorithm for these problems and compare it with a stochastic scheduling method proposed by Drexl and Gruenewald. Computational results show that the proposed genetic algorithm is superior to the stochastic scheduling method.

[1]  Erik Demeulemeester,et al.  A Random Activity Network Generator , 1993, Oper. Res..

[2]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[3]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[4]  J. M. Tamarit,et al.  Project scheduling with resource constraints: A branch and bound approach , 1987 .

[5]  Ralf Bruns,et al.  Direct Chromosome Representation and Advanced Genetic Operators for Production Scheduling , 1993, ICGA.

[6]  Edward W. Davis,et al.  An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints , 1971 .

[7]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8]  Erik Demeulemeester,et al.  A branch-and-bound procedure for the multiple resource-constrained project scheduling problem , 1992 .

[9]  Andreas Drexl,et al.  Nonpreemptive multi-mode resource-constrained project scheduling , 1993 .

[10]  L. Valadares Tavares.  A multi-stage non-deterministic model for project scheduling under resources constraints , 1990 .

[11]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[12]  F. Brian Talbot,et al.  Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case , 1982 .

[13]  Roman Słowiński,et al.  Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems , 1990 .