IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v15y1967i3p407-426.html
   My bibliography  Save this article

Decision CPM: A Method for Simultaneous Planning, Scheduling, and Control of Projects

Author

Listed:
  • W. Crowston

    (Massachusetts Institute of Technology, Cambridge, Massachusetts)

  • G. L. Thompson

    (Carnegie Institute of Technology, Pittsburgh, Pennsylvania)

Abstract

DCPM is a method for formally considering the interaction between the scheduling and the planning phases of a project. Thus, if there are a number of competing methods of performing some of the jobs, each method having a different cost, a different time duration, and different technological dependencies, these possibilities are included in the project graph. Then in the scheduling phase, consideration is made of the effects of the alternate methods of performing tasks on the total cost of completing the project. The alternatives that minimize this cost are then selected. The same method can also be applied to the control of the project during its completion, to revise previous decisions in light of actual performance observed.

Suggested Citation

  • W. Crowston & G. L. Thompson, 1967. "Decision CPM: A Method for Simultaneous Planning, Scheduling, and Control of Projects," Operations Research, INFORMS, vol. 15(3), pages 407-426, June.
    • Handle: RePEc:inm:oropre:v:15:y:1967:i:3:p:407-426
    DOI: 10.1287/opre.15.3.407
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.15.3.407
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.15.3.407?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. Roman Barták & Ondřej Čepek & Pavel Surynek, 2010. "Discovering implied constraints in precedence graphs with alternatives," Annals of Operations Research, Springer, vol. 180(1), pages 233-263, November.
    4. De, Prabuddha & James Dunne, E. & Ghosh, Jay B. & Wells, Charles E., 1995. "The discrete time-cost tradeoff problem revisited," European Journal of Operational Research, Elsevier, vol. 81(2), pages 225-238, March.
    5. M. Vanhoucke, 2007. "An electromagnetic time/cost trade-off optimization in project scheduling," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 07/457, Ghent University, Faculty of Economics and Business Administration.
    6. Gerald G. Brown & W. Matthew Carlyle & Robert C. Harney & Eric M. Skroch & R. Kevin Wood, 2009. "Interdicting a Nuclear-Weapons Project," Operations Research, INFORMS, vol. 57(4), pages 866-877, August.
    7. Singhal, Jaya & Singhal, Kalyan, 1996. "The number of feasible designs in a compatibility matrix," European Journal of Operational Research, Elsevier, vol. 94(1), pages 186-193, October.
    8. 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.
    9. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.
    10. Eleni Hadjiconstantinou & Evelina Klerides, 2010. "A new path-based cutting plane approach for the discrete time-cost tradeoff problem," Computational Management Science, Springer, vol. 7(3), pages 313-336, 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:oropre:v:15:y:1967:i:3:p:407-426. 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.