IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v18y1972i11p589-599.html
   My bibliography  Save this article

Optimal Time-Cost Trade-Offs in GERT Networks

Author

Listed:
  • S. Arisawa

    (North Carolina State University)

  • S. E. Elmaghraby

    (North Carolina State University)

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.

Suggested Citation

  • S. Arisawa & S. E. Elmaghraby, 1972. "Optimal Time-Cost Trade-Offs in GERT Networks," Management Science, INFORMS, vol. 18(11), pages 589-599, July.
    • Handle: RePEc:inm:ormnsc:v:18:y:1972:i:11:p:589-599
    DOI: 10.1287/mnsc.18.11.589
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.18.11.589
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.18.11.589?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tao, Liangyan & Wu, Desheng & Liu, Sifeng & Lambert, James H., 2017. "Schedule risk analysis for new-product development: The GERT method extended by a characteristic function," Reliability Engineering and System Safety, Elsevier, vol. 167(C), pages 464-473.
    2. Ricardo Ródenas & M. López & Doroteo Verastegui, 1999. "Extensions of Dinkelbach's algorithm for solving non-linear fractional programming problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(1), pages 33-70, June.
    3. Azaron, Amir & Tavakkoli-Moghaddam, Reza, 2007. "Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1186-1200, August.
    4. Menipaz, Ehud & Ben-Yair, Avner, 2002. "Three-parametrical harmonization model in project management by means of simulation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 59(5), pages 431-436.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:18:y:1972:i:11:p:589-599. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.