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

Marcin Anholcer () and Helena Gaspars-Wieloch ()

Operations Research and Decisions, 2011, vol. 21, issue 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 (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ord.pwr.edu.pl/assets/papers_archive/175%20-%20published.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wut:journl:v:1:y:2011:p:5-18:id:175

Access Statistics for this article

More articles in Operations Research and Decisions from Wroclaw University of Science and Technology, Faculty of Management Contact information at EDIRC.
Bibliographic data for series maintained by Adam Kasperski ().