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

Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept

Author

Listed:
  • Steve Phillips, Jr.

    (University of South Florida)

  • Mohamed I. Dessouky

    (University of Illinois, Urbana)

Abstract

This paper introduces a solution procedure for solving the project time/cost tradeoff problem of reducing a project duration at a minimum cost. The solution to the time/cost problem is achieved by locating a minimal cut in a flow network derived from the original project network. This minimal cut is then utilized to identify the project activities which should experience a duration modification in order to achieve the total project reduction. The paper will document this cut-based procedure and provide a practical application to a project situation.

Suggested Citation

  • Steve Phillips, Jr. & Mohamed I. Dessouky, 1977. "Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept," Management Science, INFORMS, vol. 24(4), pages 393-400, December.
    • Handle: RePEc:inm:ormnsc:v:24:y:1977:i:4:p:393-400
    DOI: 10.1287/mnsc.24.4.393
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.24.4.393
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.24.4.393?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. Martin Skutella, 1998. "Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 909-929, November.
    2. A B Hafızoğlu & M Azizoğlu, 2010. "Linear programming based approaches for the discrete time/cost trade-off problem in project networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 676-685, April.
    3. Janiak, Adam, 1998. "Minimization of the makespan in a two-machine problem under given resource constraints," European Journal of Operational Research, Elsevier, vol. 107(2), pages 325-337, June.
    4. R L Bregman, 2009. "Preemptive expediting to improve project due date performance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 120-129, January.
    5. Jorgensen, Trond & Wallace, Stein W., 2000. "Improving project cost estimation by taking into account managerial flexibility," European Journal of Operational Research, Elsevier, vol. 127(2), pages 239-251, December.
    6. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    7. Bregman, Robert L., 2009. "A heuristic procedure for solving the dynamic probabilistic project expediting problem," European Journal of Operational Research, Elsevier, vol. 192(1), pages 125-137, January.
    8. Cyril Briand & Sandra Ulrich Ngueveu & Přemysl Šůcha, 2017. "Finding an optimal Nash equilibrium to the multi-agent project scheduling problem," Journal of Scheduling, Springer, vol. 20(5), pages 475-491, October.
    9. Šůcha, Přemysl & Agnetis, Alessandro & Šidlovský, Marko & Briand, Cyril, 2021. "Nash equilibrium solutions in multi-agent project scheduling with milestones," European Journal of Operational Research, Elsevier, vol. 294(1), pages 29-41.
    10. Alessandro Agnetis & Cyril Briand & Sandra Ulrich Ngueveu & Přemysl Šůcha, 2020. "Price of anarchy and price of stability in multi-agent project scheduling," Annals of Operations Research, Springer, vol. 285(1), pages 97-119, February.
    11. Choi, Yunsik & Delise, Lisa A. & Lee, Brandon W. & Neely, Jerry, 2021. "Effective staffing of projects for reconciling conflict between cost efficiency and quality," International Journal of Production Economics, Elsevier, vol. 234(C).
    12. Chen, Shih-Pin & Tsai, Ming-Jiun, 2011. "Time-cost trade-off analysis of project networks in fuzzy environments," European Journal of Operational Research, Elsevier, vol. 212(2), pages 386-397, July.

    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:24:y:1977:i:4:p:393-400. 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.