Optimal project compression with due‐dated events

S. E. Elmaghraby and P. S. Pulat

Naval Research Logistics Quarterly, 1979, vol. 26, issue 2, 331-348

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.

Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800260213

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:wly:navlog:v:26:y:1979:i:2:p:331-348

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().