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

Peter Brucker

doi:10.1016/S0377-2217(98)00204-5

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

1999-01-01

1.1K

PRE

AI

DOI：10.1016/S0377-2217(98)00204-5

Original

Original request for help

Save

Abstract

En 中文

Project scheduling is concerned with single-item or small batch production where scarce resources have to be allocated to dependent activities over time. Applications can be found in diverse industries such as construction engineering, software development, etc. Also, project scheduling is increasingly important for make-to-order companies where the capacities have been cut down in order to meet lean management concepts. Likewise, project scheduling is very attractive for researchers, because the models in this area are rich and, hence, difficult to solve. For instance, the resource-constrained project scheduling problem contains the job shop scheduling problem as a special case. So far, no classification scheme exists which is compatible with what is commonly accepted in machine scheduling. Also, a variety of symbols are used by project scheduling researchers in order to denote one and the same subject. Hence, there is a gap between machine scheduling on the one hand and project scheduling on the other with respect to both, viz. a common notation and a classification scheme. As a matter of fact, in project scheduling, an ever growing number of papers is going to be published and it becomes more and more difficult for the scientific community to keep track of what is really new and relevant. One purpose of our paper is to close this gap. That is, we provide a classification scheme, i.e. a description of the resource environment, the activity characteristics, and the objective function, respectively, which is compatible with machine scheduling and which allows to classify the most important models dealt with so far. Also, we propose a unifying notation. The second purpose of this paper is to review some of the recent developments. More specifically, we review exact and heuristic algorithms for the single-mode and the multi-mode case, for the time-cost tradeoff problem. for problems with minimum and maximum time lags, for problems with other objectives than makespan minimization and, last but not least, for problems with stochastic activity durations. (C) 1999 Elsevier Science B.V. All rights reserved.

Keywords:

project scheduling resource constraints

notation

classification scheme

single-mode case

time-cost tradeoffs

multi-mode case

minimum and maximum time lags

nonregular objectives

stochastic activity durations

constraint propagation

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

Abstract

AI Summary

Journal

Organization

Cited Papers