Heuristic Procedures for Generating Stable Project Baseline Schedules

22 Pages Posted: 12 Jan 2006

See all articles by Stijn Van de Vonder

Stijn Van de Vonder

KU Leuven - Faculty of Business and Economics (FEB)

Erik Demeulemeester

Catholic University of Leuven (KUL)

Willy Herroelen

Catholic University of Leuven (KUL)

Date Written: February 16, 2005

Abstract

Solution robust project scheduling is a growing research field aiming at constructing proactive schedules to cope with multiple disruptions during project execution. When stochastic activity durations are considered, including time buffers between activities is a proven method to improve the stability of a baseline schedule. This paper introduces multiple algorithms to include time buffers in a given schedule while a predefined project due date remains respected. Multiple efficient heuristic and meta-heuristic procedures are proposed to allocate buffers throughout the schedule. An extensive simulation-based analysis of the performance of all algorithms is given. The impact of the activity duration variance structure on the performance is discussed in detail.

Suggested Citation

Van de Vonder, Stijn and Demeulemeester, Erik and Herroelen, Willy, Heuristic Procedures for Generating Stable Project Baseline Schedules (February 16, 2005). Available at SSRN: https://ssrn.com/abstract=875289 or http://dx.doi.org/10.2139/ssrn.875289

Stijn Van de Vonder (Contact Author)

KU Leuven - Faculty of Business and Economics (FEB) ( email )

Naamsestraat 69
Leuven, B-3000
Belgium

Erik Demeulemeester

Catholic University of Leuven (KUL) ( email )

Leuven, B-3000
Belgium

Willy Herroelen

Catholic University of Leuven (KUL) ( email )

Leuven, B-3000
Belgium

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
146
Abstract Views
926
Rank
360,704
PlumX Metrics