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

A Simple CPM Time-Cost Tradeoff Algorithm

Author

Listed:
  • Nicolai Siemens

    (University of Georgia)

Abstract

This article describes an algorithm for efficiently shortening the duration of a project when the expected project duration exceeds a predetermined limit. The problem consists of determining which activities to expedite and by what amount. The objective is to minimize the cost of the project. This algorithm is considerably less complex than the analytic methods currently available. Because of its inherent simplicity, the algorithm is ideally suited for hand computation and also is suitable for computer solution. Solutions derived by the algorithm were compared with linear programming results. These comparisons revealed that the algorithm solutions are either (a) equally good or (b) nearly the same as the solutions obtained by more complex analytic methods which require a computer. With this method the CPM time-cost tradeoff problem is solved without access to a computer, thereby making this planning tool available to managers who otherwise would find implementation impractical.

Suggested Citation

  • Nicolai Siemens, 1971. "A Simple CPM Time-Cost Tradeoff Algorithm," Management Science, INFORMS, vol. 17(6), pages 354-363, February.
    • Handle: RePEc:inm:ormnsc:v:17:y:1971:i:6:p:b354-b363
    DOI: 10.1287/mnsc.17.6.B354
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.17.6.B354
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.17.6.B354?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. Marcin Anholcer & Helena Gaspars-Wieloch, 2011. "Efficiency analysis of the Kaufmann and Dezbazeille algorithm for the deadline problem," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 21(1), pages 5-18.
    2. Vanhoucke, Mario, 2005. "New computational results for the discrete time/cost trade-off problem with time-switch constraints," European Journal of Operational Research, Elsevier, vol. 165(2), pages 359-374, September.
    3. Helena Gaspars, 2006. "A conception of a new algorithm for the project time-cost analysis," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 16(3-4), pages 5-27.
    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. 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.
    6. Babu, A. J. G. & Suresh, Nalina, 1996. "Project management with time, cost, and quality considerations," European Journal of Operational Research, Elsevier, vol. 88(2), pages 320-327, January.
    7. 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:17:y:1971:i:6:p:b354-b363. 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.