The resource-constrained project scheduling problem (RCPSP) consists of activities that must be scheduled subject to precedence and resource constraints such that the makespan is minimized. It has become a well-known standard problem in the context of project scheduling which has attracted...

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...

This paper considers two problem classes that are important to researchers as well as practitioners, namely packing and project scheduling problems. First, the two problem categories are described. This includes a classification of packing problems as well as of project scheduling concepts....