IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v36y2019i03ns0217595919500106.html
   My bibliography  Save this article

The Interaction Between Critical Chain Sequencing, Buffer Sizing, and Reactive Actions in a CC/BM Framework

Author

Listed:
  • Xuejun Hu

    (Business School, Hunan University, No. 2 Lushan South Street, Yuelu, Changsha, Hunan 410082, P. R. China)

  • Jianjiang Wang

    (College of Systems Engineering, National University of Defense Technology, No. 109 Deya Road, Kaifu, Changsha, Hunan 410073, P. R. China)

  • Kaijun Leng

    (Research Center of Hubei Logistics Development, Hubei University of Economics, No. 8 Yangqiaohu Road, Jiangxia, Wuhan, Hubei 430205, P. R. China)

Abstract

In the past decades, the critical chain scheduling and buffer management (CC/BM) methodology has gained widespread acceptance as an emerging project planning and control technique. This paper first presents six priority indices for selecting the optimal critical chain when more than one such chain is possible. Next, we examine four schedule generation schemes for rescheduling, along with two control actions (i.e., expediting work to shorten activity durations and adding emergency resources to bring forward activity start times) for repairing a critical chain schedule whenever activity delays cross the buffer threshold. The main results of our computational experiments include the non-negligible impact of different critical chain sequences on the project robustness measures, the appropriate level of feeding buffer sizes, and the trade-off between different reactive responses in relation to the cost factors or management preferences.

Suggested Citation

  • 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.
  • Handle: RePEc:wsi:apjorx:v:36:y:2019:i:03:n:s0217595919500106
    DOI: 10.1142/S0217595919500106
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595919500106
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0217595919500106?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. M. Suresh & Pankaj Dutta & Karuna Jain, 2015. "Resource Constrained Multi-Project Scheduling Problem with Resource Transfer Times," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-30, December.
    2. Chen, Zhi & Demeulemeester, Erik & Bai, Sijun & Guo, Yuntao, 2018. "Efficient priority rules for the stochastic resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 270(3), pages 957-967.
    3. 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.
    4. 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.
    5. Na Yin & Liying Kang, 2015. "Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-12, December.
    6. Weibo Zheng & Zhengwen He & Nengmin Wang & Tao Jia, 2018. "Proactive and reactive resource-constrained max-NPV project scheduling with random activity duration," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(1), pages 115-126, January.
    7. Kolisch, Rainer, 1996. "Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation," European Journal of Operational Research, Elsevier, vol. 90(2), pages 320-333, April.
    8. Junguang Zhang & Saike Jia & Estrella Diaz, 2018. "Dynamic monitoring and control of a critical chain project based on phase buffer allocation," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(12), pages 1966-1977, December.
    9. Fuqiang Lu & Yanli Hu & Hualing Bi & Min Huang & Meng Zhao, 2018. "An Auction Approach for Cost and Schedule Management of IT Outsourcing Project," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-23, October.
    10. Deblaere, Filip & Demeulemeester, Erik & Herroelen, Willy, 2011. "Proactive policies for the stochastic resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 214(2), pages 308-316, October.
    11. Xuejun Hu & Erik Demeulemeester & Nanfang Cui & Jianjiang Wang & Wendi Tian, 2017. "Improved critical chain buffer management framework considering resource costs and schedule stability," Flexible Services and Manufacturing Journal, Springer, vol. 29(2), pages 159-183, June.
    12. Zhang, Junguang & Song, Xiwei & Díaz, Estrella, 2016. "Project buffer sizing of a critical chain based on comprehensive resource tightness," European Journal of Operational Research, Elsevier, vol. 248(1), pages 174-182.
    13. 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.
    14. Vega-Velázquez, Miguel Ángel & García-Nájera, Abel & Cervantes, Humberto, 2018. "A survey on the Software Project Scheduling Problem," International Journal of Production Economics, Elsevier, vol. 202(C), pages 145-161.
    15. Mario Vanhoucke, 2013. "Project Management with Dynamic Scheduling," Springer Books, Springer, edition 2, number 978-3-642-40438-2, January.
    16. 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.
    17. Demeulemeester, Erik & Herroelen, Willy, 2011. "Robust Project Scheduling," Foundations and Trends(R) in Technology, Information and Operations Management, now publishers, vol. 3(3–4), pages 201-376, January.
    18. Bruni, M.E. & Di Puglia Pugliese, L. & Beraldi, P. & Guerriero, F., 2017. "An adjustable robust optimization model for the resource-constrained project scheduling problem with uncertain activity durations," Omega, Elsevier, vol. 71(C), pages 66-84.
    19. Nicholas G. Hall & Daniel Zhuoyu Long & Jin Qi & Melvyn Sim, 2015. "Managing Underperformance Risk in Project Portfolio Selection," Operations Research, INFORMS, vol. 63(3), pages 660-675, June.
    20. G Zhu & J F Bard & G Yu, 2005. "Disruption management for resource-constrained project scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 365-381, April.
    21. Jan-Yee Kung & Ming-Hung Shu, 2015. "Some Scheduling Problems on a Single Machine with General Job Effects of Position-Dependent Learning and Start-Time-Dependent Deterioration," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(02), pages 1-21.
    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. 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).
    2. Ö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.
    3. Xuejun Hu & Erik Demeulemeester & Nanfang Cui & Jianjiang Wang & Wendi Tian, 2017. "Improved critical chain buffer management framework considering resource costs and schedule stability," Flexible Services and Manufacturing Journal, Springer, vol. 29(2), pages 159-183, June.
    4. Mengqi Zhao & Xiaoling Wang & Jia Yu & Lei Bi & Yao Xiao & Jun Zhang, 2020. "Optimization of Construction Duration and Schedule Robustness Based on Hybrid Grey Wolf Optimizer with Sine Cosine Algorithm," Energies, MDPI, vol. 13(1), pages 1-17, January.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Masoud Arjmand & Amir Abbas Najafi & Majid Ebrahimzadeh, 2020. "Evolutionary algorithms for multi-objective stochastic resource availability cost problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(3), pages 935-985, September.
    10. Pejman Peykani & Jafar Gheidar-Kheljani & Sheida Shahabadi & Seyyed Hassan Ghodsypour & Mojtaba Nouri, 2023. "A two-phase resource-constrained project scheduling approach for design and development of complex product systems," Operational Research, Springer, vol. 23(1), pages 1-25, March.
    11. She, Bingling & Chen, Bo & Hall, Nicholas G., 2021. "Buffer sizing in critical chain project management by network decomposition," Omega, Elsevier, vol. 102(C).
    12. 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.
    13. Asadabadi, Mehdi Rajabi & Zwikael, Ofer, 2021. "Integrating risk into estimations of project activities' time and cost: A stratified approach," European Journal of Operational Research, Elsevier, vol. 291(2), pages 482-490.
    14. 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.
    15. 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.
    16. Junguang Zhang & Xiwei Song & Hongyu Chen & Ruixia (Sandy) Shi, 2016. "Determination of critical chain project buffer based on information flow interactions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(9), pages 1146-1157, September.
    17. Dieter Debels & Mario Vanhoucke, 2007. "A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem," Operations Research, INFORMS, vol. 55(3), pages 457-469, June.
    18. Schirmer, Andreas & Riesenberg, Sven, 1997. "Parameterized heuristics for project scheduling: Biased random sampling methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 456, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. 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.
    20. Debels, Dieter & De Reyck, Bert & Leus, Roel & Vanhoucke, Mario, 2006. "A hybrid scatter search/electromagnetism meta-heuristic for project scheduling," European Journal of Operational Research, Elsevier, vol. 169(2), pages 638-653, March.

    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:wsi:apjorx:v:36:y:2019:i:03:n:s0217595919500106. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.