Optimal Time-Cost Trade-Offs in GERT Networks

S. Arisawa and S. E. Elmaghraby
Additional contact information
S. Arisawa: North Carolina State University
S. E. Elmaghraby: North Carolina State University

Management Science, 1972, vol. 18, issue 11, 589-599

Abstract: Optimal time-cost trade-offs in deterministic networks of the CPM-type have been neatly resolved by Fulkerson. In the case of GERT-type networks, the problem is complicated by the randomness in the duration of the activity and in the likelihood of its existence. Assuming linear relationships between additional investments and expected duration and additional cost, a model is formulated in which we seek the maximization of the marginal reduction in duration per unit of investment. This, in turn, leads to a fractional linear program whose solution is obtained easily.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.11.589 (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:18:y:1972:i:11:p:589-599

Access Statistics for this article

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