An evolution programme for the resource-constrained project scheduling problem

This paper describes an implementation of an evolution programme for the resource-constrained project scheduling problem. In essentials, the problem consists of two issues; (a) to determine the order of activities without violating precedence constraints and (b) subsequently to determine earliest start time for each activity according to available resources. How to determine the order of activation is critical to the problem, because if the order is determined, a schedule can be easily constructed with some determining procedures. The basic ideas of the proposed approach are; (a) using an evolution programme to evolve an appropriate order of activities and (b) using a fit-in-best procedure to calculate the earliest start times of activities. A new approach is addressed to guide how to design genetic operators; one operator is designed to perform a wide spread search to try to explore the area beyond local optima, whereas the other is designed to perform an intensive search to try to find an improved solut...

[1]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[2]  Mitsuo Gen,et al.  Evolution program for resource constrained project scheduling problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[3]  James H. Patterson,et al.  Scheduling a Project Under Multiple Resource Constraints: A Zero-One Programming Approach , 1976 .

[4]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[5]  Willy Herroelen,et al.  An evaluation of microcomputer-based software packages for project management , 1990 .

[6]  James H. Patterson,et al.  An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems , 1978 .

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

[8]  E. W. Davis,et al.  Multiple Resource–Constrained Scheduling Using Branch and Bound , 1978 .

[9]  Elliott N. Weiss,et al.  Local search techniques for the generalized resource constrained project scheduling problem , 1993 .

[10]  Edward W. Davis,et al.  A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling , 1975 .

[11]  G. Syswerda,et al.  Schedule Optimization Using Genetic Algorithms , 1991 .

[12]  Robert L. Bulfin,et al.  Simulated annealing for resource-constrained scheduling , 1993 .

[13]  Colin E. Bell,et al.  A new heuristic solution method in resource‐constrained project scheduling , 1991 .

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

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