IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v60y2009i1d10.1057_palgrave.jors.2602529.html
   My bibliography  Save this article

Preemptive expediting to improve project due date performance

Author

Listed:
  • R L Bregman

    (University of Houston)

Abstract

Project expediting is often viewed as a corrective action taken in response to prior scheduling errors and is usually applied in the later stages of projects when it appears that predefined due dates will not be met. However, large-scale projects with uncertain activity durations tend to have numerous probabilistic network paths with complex interactions that require some level of expediting to ensure successful scheduling outcomes. Because potential expediting options are consumed over time, delaying expediting efforts until the later stages of projects is likely to result in higher expediting costs or poorer due date performance. This research introduces a preemptive expediting approach that evaluates the probability of completion before the due date throughout the life of a project and selects expediting options per a prespecified probability tolerance or expediting budget. An experiment demonstrates the benefits of this preemptive approach.

Suggested Citation

  • 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.
    • Handle: RePEc:pal:jorsoc:v:60:y:2009:i:1:d:10.1057_palgrave.jors.2602529
    DOI: 10.1057/palgrave.jors.2602529
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602529
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602529?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Salah E. Elmaghraby, 1967. "On the Expected Duration of PERT Type Networks," Management Science, INFORMS, vol. 13(5), pages 299-306, January.
    2. Thomas J. Hindelang & John F. Muth, 1979. "A Dynamic Programming Algorithm for Decision CPM Networks," Operations Research, INFORMS, vol. 27(2), pages 225-241, April.
    3. Demeulemeester, Erik L. & Herroelen, Willy S. & Elmaghraby, Salah E., 1996. "Optimal procedures for the discrete time/cost trade-off problem in project networks," European Journal of Operational Research, Elsevier, vol. 88(1), pages 50-68, January.
    4. Nicolai Siemens, 1971. "A Simple CPM Time-Cost Tradeoff Algorithm," Management Science, INFORMS, vol. 17(6), pages 354-363, February.
    5. D. R. Fulkerson, 1961. "A Network Flow Computation for Project Cost Curves," Management Science, INFORMS, vol. 7(2), pages 167-178, January.
    6. Richard M. Van Slyke, 1963. "Letter to the Editor---Monte Carlo Methods and the PERT Problem," Operations Research, INFORMS, vol. 11(5), pages 839-860, October.
    7. 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.
    8. A. R. Klingel, Jr., 1966. "Bias in Pert Project Completion Time Calculations for a Real Network," Management Science, INFORMS, vol. 13(4), pages 194-201, December.
    9. Richard A. Kaimann, 1974. "Coefficient of Network Complexity," Management Science, INFORMS, vol. 21(2), pages 172-177, October.
    10. Siemens, Nicolai & Gooding, Carl, 1975. "Reducing project duration at minimum cost: A time-cost tradeoff algorithm," Omega, Elsevier, vol. 3(5), pages 569-581, October.
    11. Richard J. Schonberger, 1981. "Why Projects Are “Always” Late: A Rationale Based on Manual Simulation of a PERT/CPM Network," Interfaces, INFORMS, vol. 11(5), pages 66-70, October.
    12. Baiocchi, Giovanni, 2004. "Using Perl for Statistics: Data Processing and Statistical Computing," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 11(i01).
    13. E. B. Berman, 1964. "Resource Allocation in a PERT Network Under Continuous Activity Time-Cost Functions," Management Science, INFORMS, vol. 10(4), pages 734-745, July.
    14. Kenneth R. MacCrimmon & Charles A. Ryavec, 1964. "An Analytical Study of the PERT Assumptions," Operations Research, INFORMS, vol. 12(1), pages 16-37, February.
    15. Prabuddha De & E. James Dunne & Jay B. Ghosh & Charles E. Wells, 1997. "Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks," Operations Research, INFORMS, vol. 45(2), pages 302-306, April.
    16. 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.
    17. 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.
    18. L. R. Lamberson & R. R. Hocking, 1970. "Optimum Time Compression in Project Scheduling," Management Science, INFORMS, vol. 16(10), pages 597-606, June.
    19. R. A. Bildson & J. R. Gillespie, 1962. "Letter to the Editor---Critical Path Planning---PERT Integration," Operations Research, INFORMS, vol. 10(6), pages 909-912, December.
    20. D. R. Fulkerson, 1962. "Expected Critical Path Lengths in PERT Networks," Operations Research, INFORMS, vol. 10(6), pages 808-817, December.
    21. W. J. Gutjahr & C. Strauss & E. Wagner, 2000. "A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 125-135, May.
    22. Don R. Robinson, 1975. "A Dynamic Programming Solution to Cost-Time Tradeoff for CPM," Management Science, INFORMS, vol. 22(2), pages 158-166, October.
    23. Foldes, Stephan & Soumis, Francois, 1993. "PERT and crashing revisited: Mathematical generalizations," European Journal of Operational Research, Elsevier, vol. 64(2), pages 286-294, January.
    24. James E. Kelley, 1961. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, INFORMS, vol. 9(3), pages 296-320, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Akkan, Can & Drexl, Andreas & Kimms, Alf, 2000. "Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 527, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. 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.
    7. 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.
    8. 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.
    9. Nicole Megow & Rolf H. Möhring & Jens Schulz, 2011. "Decision Support and Optimization in Shutdown and Turnaround Scheduling," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 189-204, May.
    10. Akkan, Can & Drexl, Andreas & Kimms, Alf, 2005. "Network decomposition-based benchmark results for the discrete time-cost tradeoff problem," European Journal of Operational Research, Elsevier, vol. 165(2), pages 339-358, September.
    11. 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.
    12. 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.
    13. 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.
    14. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    15. Azaron, Amir & Katagiri, Hideki & Sakawa, Masatoshi & Kato, Kosuke & Memariani, Azizollah, 2006. "A multi-objective resource allocation problem in PERT networks," European Journal of Operational Research, Elsevier, vol. 172(3), pages 838-854, August.
    16. Martin Skutella, 1998. "Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 909-929, November.
    17. Hongbo Li & Zhe Xu & Wenchao Wei, 2018. "Bi-Objective Scheduling Optimization for Discrete Time/Cost Trade-Off in Projects," Sustainability, MDPI, vol. 10(8), pages 1-15, August.
    18. Hajdu M. & Isaac S., 2016. "Sixty years of project planning: history and future," Organization, Technology and Management in Construction, Sciendo, vol. 8(1), pages 1499-1510, December.
    19. Thomas A. Roemer & Reza Ahmadi & Robert H. Wang, 2000. "Time-Cost Trade-Offs in Overlapped Product Development," Operations Research, INFORMS, vol. 48(6), pages 858-865, December.
    20. 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.

    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:pal:jorsoc:v:60:y:2009:i:1:d:10.1057_palgrave.jors.2602529. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.