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

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.