Cost-Duration Analysis with the Cut Network
- 1 June 1971
- journal article
- research article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 3 (2) , 123-132
- https://doi.org/10.1080/05695557108974795
Abstract
A new approach is developed for conducting a cost-duration analysis (trade-off study) for a project denned with a CPM/PERT activity network. The approach utilizes a new graph theory concept, proper oriented cut-set (POCS). It also uses the cut network, a dual-type network defined in this paper for any planar activity network. The cut network implicitly enumerates all POCS's of an original network. The cost-duration problem defined for the original activity network is transformed into a minimum-cost flow problem for the cut network. This approach to cost-duration analysis, developed here for a planar network and linear activity cost-duration relations, is optimal, conceptually direct, and has potential for application to more general cost-functions.Keywords
This publication has 3 references indexed in Scilit:
- A Structural Method of Computing Project Cost PolygonsManagement Science, 1963
- Critical-Path Planning and Scheduling: Mathematical BasisOperations Research, 1961
- Parametric Programming and the Primal-Dual AlgorithmOperations Research, 1959