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

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

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

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

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