Optimal project compression with due‐dated events
- 1 June 1979
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 26 (2) , 331-348
- https://doi.org/10.1002/nav.3800260213
Abstract
The paper proposes an algorithm for the determination of the solution of the activities to be shortened and the amount by which they are to be shortened in order to minimize the total cost of project completion. This cost involves a linear penalty for tardienss of a set of key events and a linear cost of activity compression from its normal duration. The procedure is a generalization of the work of Fulkerson.Keywords
This publication has 2 references indexed in Scilit:
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- A Network Flow Computation for Project Cost CurvesManagement Science, 1961