Resource-constrained project scheduling: Notation, classification, models, and methods

Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem

“…Recent years have witnessed a tremendous increase in research for the RCPSP, both in terms of heuristic and optimal procedures. We refer to the surveys provided by Icmeli et al [13], Özdamar and Ulusoy [28], Herroelen et al [12], Kolisch and Padman [20], and Brucker et al [6]. Recently, Kolisch and Hartmann [19] have given a specific overview of heuristics for the RCPSP.…”

Handbook on Project Management and Scheduling Vol.1

“…Chapter 61 presents a related study in which Marjolein Caniëls and Ralph Bakens focus on the role of PMIS in multi-project environments, where project managers handle multiple concurrent but generally less complex projects. After a survey of the literature on multi-project management and PMIS the research model is introduced, which contains six constructs: the project overload, the information overload, the PMIS information quality, the satisfaction with PMIS, the use of PMIS information, Table 2 Overview of project scheduling problems treated in the handbook, respective acronyms used in the literature, and three-field notations of Brucker et al (1999) and the quality of decision making. Based on the results of a survey among project managers, several hypotheses on the relationships between the constructs are tested using the partial least square method.…”

“…In the literature many of those problems are commonly designated by acronyms, which are provided in the third column of the table. The last column lists the respective designators of the (extended) three-field classification scheme for project scheduling problems proposed by Brucker et al (1999). The notation introduced there and the classification scheme, which are used in different parts of this handbook, are defined in the list of symbols, which is included in the front matter of this book.…”

The Multi-Mode Resource-Constrained Project Scheduling Problem

“…A schedule S is defined by a vector of activity start times and is said to be feasible if all precedence and renewable and non-renewable resource constraints are satisfied. The objective of the problem type is to find a feasible schedule within the lowest possible project makespan, and hence, the problem type can be represented as m, 1T |cpm, disc, mu|C max using the classification scheme of Herroelen et al (1999) or as MPS|prec|C max following the classification scheme of Brucker et al (1999). The multi-mode resource-constrained project scheduling problem can be formulated as follows (see Talbot 1982):…”