Skip to main content
Log in

A heuristic for the critical chain scheduling problem based on left shifts of activities

  • Published:
Flexible Services and Manufacturing Journal Aims and scope Submit manuscript

Abstract

The critical chain method (CCM) is a promising project management and scheduling method. Inserting feeding buffers into the baseline schedule is a crucial step in generating the critical chain schedule. However, it will lead to new resource conflicts due to resource constraints. At present, there is a scarcity of study on this subject, and the methods used in the existing literature tend to be oversimplified. This work presents a new solution for critical chain scheduling based on left shifts of activities in the theoretical framework of the CCM. The hypotheses for resolving the precedence and resource conflicts arising from inserting feeding buffers are comprehensively investigated. Under the hypothesis that the sizes of feeding buffers are not permitted to be justified, we insert feeding buffers based on the left shifts of activities and the recursion technique. The priority rule-based method is used in the left shifts to resolve precedence and resource conflicts, and thus, a heuristic for critical chain scheduling is proposed. Finally, we conduct computational experiments to test the performance of 11 priority rules and 121 priority rule pairs in the heuristics. The experimental results will help to choose priority rules when applying the presented heuristic to real-world project management.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Bie L, Cui N, Zhang X (2012) Buffer sizing approach with dependence assumption between activities in critical chain scheduling. Int J Prod Res 50(24):7343–7735

    Article  Google Scholar 

  • Colin J, Vanhoucke M (2015) A comparison of the performance of various project control methods using earned value management systems. Expert Syst Appl 42(6):3159–3175

    Article  Google Scholar 

  • Cooper DF (1976) Heuristics for scheduling resource-constrained projects: An experimental investigation. Manage Sci 22(11):1186–1194

    Article  MATH  Google Scholar 

  • Elmaghraby S, Herroelen WS, Leus R (2003) Note on the paper ‘resource-constrained project management using enhanced theory of constraint’ by Wei et al. Int J Project Manage 21(4):301–305

    Article  Google Scholar 

  • Falk C, Pateman B, Moran JM, Cohen R (2015) Handbook on Project Management and Scheduling, vol 1. Springer, International Publishing

    Google Scholar 

  • Goldratt EM (1997) Critical chain. The North River Press, Great Barrington

    Google Scholar 

  • Herroelen WS, Leus R (2005) Project scheduling under uncertainty: survey and research potentials. Eur J Oper Res 165(2):289–306

    Article  MATH  Google Scholar 

  • Herroelen WS, Leus R (2001) On the merits and pitfalls of critical chain scheduling. J Oper Manag 19(5):559–577

    Article  Google Scholar 

  • Hoel K, Taylor SG (1999) Quantifying buffers for project schedules. Prod Inventory Manage J 40(2):43–47

    Google Scholar 

  • Hu X, Cui N, Demeulemeester E, Bie L (2016) Incorporation of activity sensitivity measures into buffer management to manage project schedule risk. Eur J Oper Res 249(2):717–727

    Article  Google Scholar 

  • Hu X, Demeulemeester E, Cui N, Wang J, Tian W (2017) Improved critical chain buffer management framework considering resource costs and schedule stability. Flex Serv Manuf J 29:59–183

    Article  Google Scholar 

  • Kishira Y (2009) WA: Transformation Management by Harmony. North River Press, Great Barrington, MA

    Google Scholar 

  • Klein R (2000) Bidirectional planning: Improving priority rule-based heuristics for scheduling resource-constrained projects. Eur J Oper Res 127(3):619–638

    Article  MATH  Google Scholar 

  • Kolisch R (1996) Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. Eur J Oper Res 90(2):320–333

    Article  MathSciNet  MATH  Google Scholar 

  • Leach LP (2016) Critical chain project management. A Handbook for Construction. Plann Scheduling 32(2):35

    Google Scholar 

  • Luong DL, Ario O (2008) Fuzzy critical chain method for project scheduling under resource constraints and uncertainty. Int J Project Manage 26(6):688–698

    Article  Google Scholar 

  • Millhiser WP, Szmerekovsky JG (2012) Teaching critical chain project management: the academic debate and illustrative examples. INFORMS Trans Educ 12(2):67–77

    Article  Google Scholar 

  • Newblod RC (1998) Project management in the Fast Lane: Applying the theory of constraints. St Lucie Press, pp 55–57

  • Peng W, Huang M, Yongping H (2015) A multi-mode critical chain scheduling method based on priority rules. Prod Plann &Control 26(12):1011–1024

    Article  Google Scholar 

  • Roghanian E, Alipour M, Rezaei M (2018) An improved fuzzy critical chain approach in order to face uncertainty in project scheduling. Int J Constr Manage 18(1):1–13

    Google Scholar 

  • Schirmer A (2001) Resource-constrained project scheduling: An evaluation of parameterized sampling heuristics. Int J Prod Res 39(7):1343–1365

    Article  MATH  Google Scholar 

  • She B, Chen B, Hall NG (2021) Buffer sizing in critical chain project management by network decomposition. Omega 102(C):102382

    Article  Google Scholar 

  • Styen H (2000) An investigation into the fundamentals of critical chain project scheduling. Int J Project Manage 19:363–369

    Article  Google Scholar 

  • Tian W, Cui NF, Fu ZH (2011) Rescheduling based on branch-and-bound in critical chain project scheduling. Appl Res Comput 28(11):4035–4048

    Google Scholar 

  • Tukel OI, Rom WO, Eksioglu SD (2006) An investigation of buffer sizing techniques in critical chain scheduling. Eur J Oper Res 172(2):401–416

    Article  MATH  Google Scholar 

  • Van De Vonder S, Demeulemeester E, Herroelen W, Leus R (2006) The trade-of between stability and make span in resource-constrained project scheduling. Int J Prod Res 44(2):215–236

    Article  MATH  Google Scholar 

  • Wang WX, Wang X, Ge XL, Deng L (2014) Multi-objective optimization model for multi-project scheduling on critical chain. Adv Eng Softw 68(1):33–39

    Article  Google Scholar 

  • Wei CC, Liu PH, Tsai YC (2002) Resource-constrained project management using enhanced theory of constraint. Int J Project Manage 20(7):561–567

    Article  Google Scholar 

  • Yang S, Fu L (2014) Critical chain and evidence reasoning applied to multi-project resource schedule in automobile R&D process. Int J Project Manage 32(1):166–177

    Article  Google Scholar 

  • Zarghami SA, Gunawan I, Zubielqui GCD, Baroudi B (2020) Incorporation of resource reliability into critical chain project management buffer sizing. Int J Prod Res 3:1–15

    Google Scholar 

  • Zhang JW, Liu GT (2015) Critical chain project scheduling problem with the robust objective. J Syst Eng (in Chinese) 30(1):135–144

    Google Scholar 

  • Zhang JW, Qiao CZ, Liu GT (2017a) Strategy to eliminate the second resource conflicts in critical chain method based on robustness. J Manage Sci China 20(3):106–119

    Google Scholar 

  • Zhang JG, Jia S, Diaz E (2015) A new buffer sizing approach based on the uncertainty of project activities. Concur Eng 23(1):3–12

    Article  Google Scholar 

  • Zhang JG, Song XW, Diaz E (2017b) Critical chain project buffer sizing based on resource constraints. Int J Prod Res 55(3):671–683

    Article  Google Scholar 

  • Zhao Y, Cui N, Tian W (2020) A two-stage approach for the critical chain project rescheduling. Ann Oper Res 285(1–2):67–95

    Article  MathSciNet  Google Scholar 

  • Zheng Z, Guo Z, Zhu Y, Zhang X (2014) A critical chains based distributed multi-project scheduling approach. Neurocomputing 143(2):282–293

    Article  Google Scholar 

Download references

Funding

This research was funded by the National Natural Science Foundation of China under Grant No.71671117 and 71971173.

Author information

Authors and Affiliations

Authors

Contributions

Wuliang Peng conceived and designed the study, Xuejun Lin developed the algorithm, and performed the experiments.

Corresponding author

Correspondence to Wuliang Peng.

Ethics declarations

Conflicts of interest/Competing interests

The authors declared that they have no conflicts of interest to this work.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Peng, W., Lin, X. A heuristic for the critical chain scheduling problem based on left shifts of activities. Flex Serv Manuf J 35, 1313–1336 (2023). https://doi.org/10.1007/s10696-022-09466-7

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10696-022-09466-7

Keywords

Navigation