We consider the classical resource-constrained project scheduling problem (RCPSP). The paper gives a detailed algorithmic description and provides theoretical results on two widely known problem specific heuristics: The serial and the parallel scheduling scheme. An in-depth computational study...

We present a set of benchmark instances for the evaluation of Solution procedures for single- and multi-mode resource-constrained project scheduling problems. The instances have been systematically generated by the Standard project generator ProGen. They are characterized by the input-parameters...

This study assesses the quality of seven commercial project management systems to perform finite scheduling. We give a brief survey of the way commercial project management systems work and especially how they perform finite scheduling. Since the implemented methods are proprietary, we measure...

The paper describes an algorithm for the generation of a general class of precedence- and resource-constrained scheduling problems. Easy and hard instances for the single- and multi-mode resource-constrained project scheduling problem are benchmarked by using the state of the art...

We consider the resource-constrained project scheduling problem (RCPSP). The focus of the paper is on a formal definition of semi-active, active, and non-delay schedules. Traditionally these schedules establish basic concepts within the job shop scheduling literature. There they are usually...