Issue: 2011/Vol.21/No.1, Pages 5-18
EFFICIENCY ANALYSIS OF THE KAUFMANN AND DEZBAZEILLE ALGORITHM FOR THE DEADLINE PROBLEM
Marcin Anholcer
, Helena Gaspars-Wieloch
Cite as: M. Anholcer, H. Gaspars-Wieloch. Efficiency analysis of the Kaufmann and Dezbazeille algorithm for the deadline problem. Operations Research and Decisions 2011: 21(1), 5-18.
Abstract
Time-cost tradeoff analysis is a very important issue in project management. The Kaufmann–Des- bazeille algorithm is considered by numerous authors to be an exact algorithm to solve this problem. In the paper, we prove that this claim is not true. In particular, we perform a worst-case analysis. The accuracy of the KDA is the worst when: the network has many critical and subcritical paths with a lot of common arcs (i), shortening costs are constant (ii), the level of shortening costs for a given activity depends on its type.
Keywords: time-cost trade-off analysis, network, critical path, accuracy of an algorithm, project compression time, time-cost curves
Received: Accepted: