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

Die vorliegende Arbeit zeigt, welchen Beitrag die Koordinations- und Integrationsmechanismen des Projektmanagements zur effizienten Abwicklung von Projekten leisten können. Im Rahmen einer Taxonomie wird zwischen intrafunktionaler, interfunktionaler und interorganisationaler Koordination...

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

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

In machine tool assembly several make-to-order products have to be manufactured simultaneously in a multi-stage production system. Due to customer requirements batches are very small. A process plan specifies the neccessary machines, tools, auxiliary devices as well as the operations to be...

We review the well-known RSM priority rule to solve the resource constrained project scheduling problem. A detailed analysis of this rule reveals that it is based on assumptions which do not hold in general and hence might lead to poor solutions. Consequently, an improved RSM priority rule is...

In this paper we propose a new heuristic to solve the well-known multiple resource-constrained project scheduling problem. The method is basically a biased random sampling procedure which shows extremely good results by use of the following features: A problem-based selection of the solution...

This paper addresses a general class of nonpreemptive resource-constrained project scheduling problems in which activity durations are discrete functions of committed renewable and nonrenewabe resources. We provide a 0-1 problem formulation and stress the importance of the outlined model by...