Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 1

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  network, critical path
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Content available remote

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

100%
ANHOLCER M., GASPARS-WIELOCH H.
Operations Research and Decisions
|
2011
|
vol. 21
|
issue 1
5-18
EN
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.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.