Proactive policies for the stochastic resource-constrained project scheduling problem

► In this paper we study the RCPSP when activity durations are uncertain. ► We consider positive and negative deviations from the predictive activity starting times of inflexible activities. ► Costs are also associated with exceeding the project due date and a bonus is awarded when finishing early....

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 214; no. 2; pp. 308 - 316
Main Authors Deblaere, Filip, Demeulemeester, Erik, Herroelen, Willy
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 16.10.2011
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Online AccessGet full text
ISSN0377-2217
1872-6860
DOI10.1016/j.ejor.2011.04.019

Cover

Loading…
More Information
Summary:► In this paper we study the RCPSP when activity durations are uncertain. ► We consider positive and negative deviations from the predictive activity starting times of inflexible activities. ► Costs are also associated with exceeding the project due date and a bonus is awarded when finishing early. ► We derive optimal predictive starting times based on the newsvendor problem. ► Our procedure is vastly superior than the current state-of-the-art for this problem. The resource-constrained project scheduling problem involves the determination of a schedule of the project activities, satisfying the precedence and resource constraints while minimizing the project duration. In practice, activity durations may be subject to variability. We propose a stochastic methodology for the determination of a project execution policy and a vector of predictive activity starting times with the objective of minimizing a cost function that consists of the weighted expected activity starting time deviations and the penalties or bonuses associated with late or early project completion. In a computational experiment, we show that our procedure greatly outperforms existing algorithms described in the literature.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2011.04.019