IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v285y2020i1d10.1007_s10479-019-03347-3.html
   My bibliography  Save this article

A two-stage approach for the critical chain project rescheduling

Author

Listed:
  • Yan Zhao

    (Zhongnan University of Economics and Law)

  • Nanfang Cui

    (Huazhong University of Science and Technology)

  • Wendi Tian

    (Wuhan Textile University)

Abstract

The fundamental principle of critical chain project management is to use the critical chain instead of a traditional critical path, to insert a project buffer at the end of the project and to insert feeding buffers wherever non-critical chains join the critical chain to protect a timely project completion. Due to the complexity of project, inserting feeding buffers may cause a conflict, such as precedence conflict or resource conflict, which can be solved by rescheduling. However, after rescheduling some new problems may arise: non-critical chain may start earlier than critical chain (non-critical chain overflow), or a gap may occur between activities on the critical chain (critical chain break-down). This paper is aiming to solve these new problems by a two-stage approach combined with feeding buffer for rescheduling. In the first stage, a first-stage rescheduling based on priority rules together with a backward-recursive procedure is proposed for rescheduling to solve resource and precedence conflicts, resulting in a critical chain break-down or a non-critical chain overflow. In the second stage, a second-stage rescheduling based on a heuristic algorithm is proposed to eliminate new problems and generate a better rescheduling scheme. Finally, we do simulations on the 110 Patterson instances set to verify the feasibility, effectiveness and applicability of our two-stage approach for rescheduling. Simulation results show that, it is an effective approach to generate reliable rescheduling schemes in most projects with excellent performances, i.e. the average project length, timely project completion probability and etc.

Suggested Citation

  • Yan Zhao & Nanfang Cui & Wendi Tian, 2020. "A two-stage approach for the critical chain project rescheduling," Annals of Operations Research, Springer, vol. 285(1), pages 67-95, February.
    • Handle: RePEc:spr:annopr:v:285:y:2020:i:1:d:10.1007_s10479-019-03347-3
    DOI: 10.1007/s10479-019-03347-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-019-03347-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-019-03347-3?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. Erik Demeulemeester & Willy Herroelen, 1992. "A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 38(12), pages 1803-1818, December.
    2. Wendi Tian & Erik Demeulemeester, 2014. "Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment," Annals of Operations Research, Springer, vol. 213(1), pages 271-291, February.
    3. Jovanović, Predrag & Kecman, Pavle & Bojović, Nebojša & Mandić, Dragomir, 2017. "Optimal allocation of buffer times to increase train schedule robustness," European Journal of Operational Research, Elsevier, vol. 256(1), pages 44-54.
    4. Herroelen, Willy & Leus, Roel, 2004. "The construction of stable project baseline schedules," European Journal of Operational Research, Elsevier, vol. 156(3), pages 550-565, August.
    5. Junguang Zhang & Xiwei Song & Estrella Díaz, 2017. "Critical chain project buffer sizing based on resource constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 55(3), pages 671-683, February.
    6. Rune Larsen & Marco Pranzo, 2019. "A framework for dynamic rescheduling problems," International Journal of Production Research, Taylor & Francis Journals, vol. 57(1), pages 16-33, January.
    7. Tukel, Oya I. & Rom, Walter O. & Eksioglu, Sandra Duni, 2006. "An investigation of buffer sizing techniques in critical chain scheduling," European Journal of Operational Research, Elsevier, vol. 172(2), pages 401-416, July.
    8. Van de Vonder, Stijn & Demeulemeester, Erik & Herroelen, Willy & Leus, Roel, 2005. "The use of buffers in project management: The trade-off between stability and makespan," International Journal of Production Economics, Elsevier, vol. 97(2), pages 227-240, August.
    9. Rabbani, M. & Fatemi Ghomi, S.M.T. & Jolai, F. & Lahiji, N.S., 2007. "A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept," European Journal of Operational Research, Elsevier, vol. 176(2), pages 794-808, January.
    10. James H. Patterson, 1984. "A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem," Management Science, INFORMS, vol. 30(7), pages 854-867, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Purva Grover & Arpan Kumar Kar & Yogesh K. Dwivedi, 2022. "Understanding artificial intelligence adoption in operations management: insights from the review of academic literature and social media discussions," Annals of Operations Research, Springer, vol. 308(1), pages 177-213, January.
    2. Junguang Zhang & Dan Wan, 2021. "Determination of early warning time window for bottleneck resource buffer," Annals of Operations Research, Springer, vol. 300(1), pages 289-305, May.

    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. Cui, Nanfang & Demeulemeester, Erik & Bie, Li, 2016. "Incorporation of activity sensitivity measures into buffer management to manage project schedule riskAuthor-Name: Hu, Xuejun," European Journal of Operational Research, Elsevier, vol. 249(2), pages 717-727.
    2. Wendi Tian & Erik Demeulemeester, 2014. "Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment," Annals of Operations Research, Springer, vol. 213(1), pages 271-291, February.
    3. Yangyang Liang & Nanfang Cui & Tian Wang & Erik Demeulemeester, 2019. "Robust resource-constrained max-NPV project scheduling with stochastic activity duration," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 219-254, March.
    4. Morteza Davari & Erik Demeulemeester, 2019. "The proactive and reactive resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 22(2), pages 211-237, April.
    5. Xuejun Hu & Jianjiang Wang & Kaijun Leng, 2019. "The Interaction Between Critical Chain Sequencing, Buffer Sizing, and Reactive Actions in a CC/BM Framework," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(03), pages 1-22, June.
    6. Öncü Hazir & Gündüz Ulusoy, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," Post-Print hal-02898162, HAL.
    7. Hazır, Öncü & Ulusoy, Gündüz, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," International Journal of Production Economics, Elsevier, vol. 223(C).
    8. Sönke Hartmann, 1998. "A competitive genetic algorithm for resource‐constrained project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(7), pages 733-750, October.
    9. Carlier, Jacques & Neron, Emmanuel, 2000. "A new LP-based lower bound for the cumulative scheduling problem," European Journal of Operational Research, Elsevier, vol. 127(2), pages 363-382, December.
    10. Kolisch, Rainer, 1994. "Serial and parallel resource-constrained projekt scheduling methodes revisited: Theory and computation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 344, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Simpson, Wendell P. & Patterson, James H., 1996. "A multiple-tree search procedure for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 89(3), pages 525-542, March.
    12. Viana, Ana & Pinho de Sousa, Jorge, 2000. "Using metaheuristics in multiobjective resource constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 120(2), pages 359-374, January.
    13. Demeulemeester, Erik L. & Herroelen, Willy S., 1996. "Modelling setup times, process batches and transfer batches using activity network logic," European Journal of Operational Research, Elsevier, vol. 89(2), pages 355-365, March.
    14. Dayal Madhukar & Verma, Sanjay, 2015. "Multi-processor Exact Procedures for Regular Measures of the Multi-mode RCPSP," IIMA Working Papers WP2015-03-25, Indian Institute of Management Ahmedabad, Research and Publication Department.
    15. Klein, Robert & Scholl, Armin, 1999. "Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 112(2), pages 322-346, January.
    16. Kolisch, Rainer, 1994. "Efficient priority rules for the resource-constrained project scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 350, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    17. Herroelen, Willy S. & Van Dommelen, Patrick & Demeulemeester, Erik L., 1997. "Project network models with discounted cash flows a guided tour through recent developments," European Journal of Operational Research, Elsevier, vol. 100(1), pages 97-121, July.
    18. Sha, Yue & Zhang, Junlong & Cao, Hui, 2021. "Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties," European Journal of Operational Research, Elsevier, vol. 290(3), pages 886-900.
    19. She, Bingling & Chen, Bo & Hall, Nicholas G., 2021. "Buffer sizing in critical chain project management by network decomposition," Omega, Elsevier, vol. 102(C).
    20. Kolisch, Rainer & Sprecher, Arno, 1996. "PSPLIB - a project scheduling problem library," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 396, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:spr:annopr:v:285:y:2020:i:1:d:10.1007_s10479-019-03347-3. 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.springer.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.