Resource constrained project scheduling problems are very difficult to solve to optimality. Because of the computational complexity, scheduling heuristics have been found useful for large deterministic problems. However, these scheduling heuristics have not been applied to problems with stochastic task durations. Heuristics are often combined to try to achieve better performance. When this is done, a search over all possible combinations is generally required. This is again a very computationally intensive task, especially for stochastic problems. We demonstrate how a genetic algorithm can be used to determine the best linear combination of scheduling heuristics. A simulation model is used to evaluate the performance of each combination of the heuristics selected by the genetic algorithm, and this performance information is used by the genetic algorithm to select the next combinations to evaluate. The genetic algorithm and simulation based approach is demonstrated using a multiple resource constrained project scheduling problem with stochastic task durations.
[1]
Erik Demeulemeester,et al.
A branch-and-bound procedure for the multiple resource-constrained project scheduling problem
,
1992
.
[2]
D. E. Goldberg,et al.
Genetic Algorithms in Search, Optimization & Machine Learning
,
1989
.
[3]
Elsayed A. Elsayed,et al.
Heuristics for resource-constrained scheduling†
,
1986
.
[4]
F. F. Boctor,et al.
Some efficient multi-heuristic procedures for resource-constrained project scheduling
,
1990
.
[5]
E. W. Davis,et al.
Project Management With Cpm, Pert and Precedence Diagramming
,
1983
.
[6]
Moo Young,et al.
Analysis of risk of extreme events in scheduling problems with stochastic task durations
,
1995
.
[7]
D. E. Goldberg,et al.
Genetic Algorithms in Search
,
1989
.
[8]
Abel A. Fernandez.
An optimal solution to the resource constrained project scheduling problem with stochastic task durations
,
1995
.