Extending CPM for Multiform Project Time-Cost Curves

Abstract

The time-cost phase of CPM is extended with Integer Linear Programming techniques. Using the mathematical models developed, it is possible to determine the minimum project cost for each feasible project duration irrespective of the types of duration-cost relationships associated with the operations in the project. The types of operation duration-cost relationships that are considered are: (1) Non-increasing, bounded, piece-wise linear, continuous, and non-convex; (2) bounded but defined only at discrete points; and (3) bounded but discontinuous. An example project composed of nine operations is included to demonstrate that the formulations describing these relationships can be combined in any number of ways to describe any conceivable operation, duration-cost relationship. The formulations of the example are solved using a large scale computer, and the results are presented and analyzed. The conclusions indicate that while the models developed are sound and completely general, the required computer solution process needs a considerable degree of development. Present (1965) computer programs are capable of solving only projects with less than 50 operations.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 49 citations exist upstream.