Efficiency analysis of the Kaufmann and Dezbazeille algorithm for the deadline problem

Time-cost tradeoff analysis is a very important issue in project management. The Kaufmann–Desbazeille 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.

[1]  D. R. Fulkerson.  A Network Flow Computation for Project Cost Curves , 1961 .

[2]  Chris Hendrickson,et al.  Project Management for Construction: Fundamental Concepts for Owners, Engineers, Architects, and Builders , 1989 .

[3]  Helena Gaspars.  Analiza czasowo-kosztowa (CPM-COST). Algorytm a model optymalizacyjny , 2006 .

[4]  Helena Gaspars-Wieloch.  Przegląd wybranych metod skracania czasu realizacji przedsięwzięcia , 2008 .

[5]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[6]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[7]  Joseph J. Moder,et al.  Project Management with CPM and PERT , 1964 .

[8]  M. Dessouky,et al.  Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept , 1977 .

[9]  Helena Gaspars,et al.  Propozycja nowego algorytmu w analizie czasowo-kosztowej przedsięwzięć , 2006 .

[10]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[11]  Wallace B. S. Crowston,et al.  Decision CPM: A Method for Simultaneous Planning, Scheduling, and Control of Projects , 1967, Oper. Res..

[12]  Mik Wisniewski.  A Practical Introduction to Management Science , 1989 .

[13]  Prabuddha De,et al.  The discrete time-cost tradeoff problem revisited , 1995 .

[14]  J. Horowitz,et al.  Critical Path Problems with Concave Cost-Time Curves , 1972 .

[15]  Martin Skutella,et al.  Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem , 1997, Math. Oper. Res..

[16]  E. B. Berman,et al.  Resource Allocation in a PERT Network Under Continuous Activity Time-Cost Functions , 1964 .

[17]  Cengiz Haksever,et al.  Flexible Model for Time'Cost Tradeoff Problem , 2004 .

[18]  A. Schrijver.  A Course in Combinatorial Optimization , 1990 .

[19]  John F. Muth,et al.  A Dynamic Programming Algorithm for Decision CPM Networks , 1979, Oper. Res..

[20]  S. K. Goyal.  Note---A Note on “A Simple CPM Time-Cost Tradeoff Algorithm” , 1975 .

[21]  William Prager.  A Structural Method of Computing Project Cost Polygons , 1963 .

[22]  James E. Kelley,et al.  Critical-Path Planning and Scheduling: Mathematical Basis , 1961 .

[23]  D. Panagiotakopoulos.  A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions , 1977 .

[24]  Chung-Wei Feng,et al.  Construction Time-Cost Trade-Off Analysis Using LP/IP Hybrid Method , 1995 .

[25]  Nicolai Siemens.  A Simple CPM Time-Cost Tradeoff Algorithm , 1971 .

[26]  J W Fondahl,et al.  A non-computer approach to the critical path method , 1962 .