On the merits and pitfalls of critical chain scheduling

被引:266
作者
Herroelen, W [1 ]
Leus, R [1 ]
机构
[1] Katholieke Univ Leuven, Dept Appl Econ, Operat Management Grp, B-3000 Louvain, Belgium
关键词
project management; project planning; scheduling;
D O I
10.1016/S0272-6963(01)00054-7
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The direct application of the Theory of Constraints (TOC) to project management, known as Critical Chain Scheduling and Buffer Management (CC/BM), has recently emerged as one of the most popular approaches to project management. It is the objective of this paper to highlight the merits and pitfalls of the CC/BM scheduling approach. Following a short overview of the fundamentals of CC/BM, the strengths and weaknesses of the approach are put into perspective, based on a critical analysis of the literature as well as our own experimentation with commercial CC/BM software. The CC/BM scheduling mechanism is tested in a full factorial experiment performed on a set of benchmark problems. It appears that the 50% rule for buffer sizing may lead to a serious overestimation of the required buffer protection. Regularly updating the baseline schedule and the critical chain provides the best intermediate estimates of the final project duration and yields the smallest final project duration. Using clever project scheduling and rescheduling mechanisms such as branch-and-bound, has a beneficiary effect on the final makespan. (C) 2001 Elsevier Science B.V All rights reserved.
引用
收藏
页码:559 / 577
页数:19
相关论文
共 51 条
[1]  
Aitchison J, 1973, LOGNORMAL DISTRIBUTI
[2]  
CABANISBREWIN J, 1999, PM NETWORK, V13, P49
[3]  
Clough R.H., 1991, CONSTRUCTION PROJECT, V3rd ed.
[4]  
Cook D.R., 1999, APPL REGRESSION INCL
[5]   The multi-mode resource-constrained project scheduling problem with generalized precedence relations [J].
De Reyck, B ;
Herroelen, W .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 119 (02) :538-556
[6]  
De Reyck B, 1998, NAV RES LOG, V45, P553, DOI 10.1002/(SICI)1520-6750(199809)45:6<553::AID-NAV2>3.0.CO
[7]  
2-1
[8]   The discrete time/resource trade-off problem in project networks: a branch-and-bound approach [J].
Demeulemeester, E ;
De Reyck, B ;
Herroelen, W .
IIE TRANSACTIONS, 2000, 32 (11) :1059-1069
[9]   A BRANCH-AND-BOUND PROCEDURE FOR THE MULTIPLE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM [J].
DEMEULEMEESTER, E ;
HERROELEN, W .
MANAGEMENT SCIENCE, 1992, 38 (12) :1803-1818
[10]   New computational results on the discrete time/cost trade-off problem in project networks [J].
Demeulemeester, E ;
De Reyck, B ;
Foubert, B ;
Herroelen, W ;
Vanhoucke, M .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1998, 49 (11) :1153-1163