A Simple CPM Time-Cost Tradeoff Algorithm

Nicolai Siemens
Additional contact information
Nicolai Siemens: University of Georgia

Management Science, 1971, vol. 17, issue 6, B354-B363

Abstract: This article describes an algorithm for efficiently shortening the duration of a project when the expected project duration exceeds a predetermined limit. The problem consists of determining which activities to expedite and by what amount. The objective is to minimize the cost of the project. This algorithm is considerably less complex than the analytic methods currently available. Because of its inherent simplicity, the algorithm is ideally suited for hand computation and also is suitable for computer solution. Solutions derived by the algorithm were compared with linear programming results. These comparisons revealed that the algorithm solutions are either (a) equally good or (b) nearly the same as the solutions obtained by more complex analytic methods which require a computer. With this method the CPM time-cost tradeoff problem is solved without access to a computer, thereby making this planning tool available to managers who otherwise would find implementation impractical.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.17.6.B354 (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:inm:ormnsc:v:17:y:1971:i:6:p:b354-b363

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().