This paper discusses an extension of the classical resource-constrained project scheduling problem (RCPSP) in which the resource availability as well as the resource request of the activities may change from period to period. While the applicability of this extension should be obvious, we...

In this paper we consider the resource-constrained project scheduling problem with multiple execution modes for each activity and makespan minimization as objective. We present a new genetic algorithm approach to solve this problem. The genetic encoding is based on a precedence feasible sequence...