Evaluating performance of Critical Chain Project Management to mitigate delays based on different schedule network complexities

摘要

The Critical Chain Project Management (CCPM) method uses both project and feeder buffers in network schedules to act as cushions that absorb delays. These buffers are periods that are placed at the ends of critical or non-critical paths within the schedule. But how CCPM performs for probabilistic schedules has barely been studied systematically. It is hypothesized that the complexity of the networks influences how efficiently allocated buffers can fulfill their protective role. This paper therefore explores the relationship between complexity indices and the delay-mitigating performance of CCPM. Its contribution to the body of knowledge is twofold: First, schedule network complexity indices are reviewed and a schedule network graphing module is developed, which identifies the critical chain and buffer locations. Second, CCPM is applied to networks of different complexity with probabilistic durations. Their performance is measured in Monte Carlo simulations to evaluate the efficacy of buffer allocation under various different scenarios.