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

We consider a generalization of the classical resource constrained project scheduling problem. We introduce so-called partially reiiewable resources by assuming for each resource a capacity on subsets of periods. The concept of partially renewable resources is a fundamental tool in order to make...

Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences or feasible subsets, they all aim at finding as fast as possible...

Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem (RCPSP) have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences, feasible completion times or feasible subsets, they all...

Numerous exact algorithms have been developed for solving the resource-constrained project scheduling problem. Experimental studies have shown that currently even projects with only 60 activities cannot be optimally solved within a reasonable amount of time. Therefore heuristics employing...

We consider the multi-mode resource-constrained project scheduling problem. The focus is on an algorithm which is supposed to find a makespan optimal solution. This algorithm has been presented in a recent paper by Speranza and Vercellis. The correctness of the algorithm is examined. Moreover,...