1,052
Views
27
CrossRef citations to date
0
Altmetric
Articles

An improved fuzzy critical chain approach in order to face uncertainty in project scheduling

, ORCID Icon &

References

  • Ahlemann F, El Arbi, F, Kaiser MG, Heck A. 2013. A process framework for theoretically grounded prescriptive research in the project management field. Int J Project Manage. 31:43–56.
  • Barrios A, Ballestín F, Valls V. 2011. A double genetic algorithm for the MRCPSP/max. Comput Oper Res. 38:33–43.
  • Bevilacqua M, Ciarapica FE, Giacchetta G. 2009. Critical chain and risk analysis applied to high-risk industry maintenance: a case study. Int J Project Manage. 27:419–432.
  • Blazewicz J, Lenstra JK, Kan, AR. 1983. Scheduling subject to resource constraints: classification and complexity. Discrete Appl Math. 5:11–24.
  • Bouleimen K, Lecocq H. 2003. A new efficient simulated annealing algorithm for the resource – constrained project scheduling problem and its multiple mode version. Eur J Oper Res. 149:268–281.
  • Brucker P, Knust S, Schoo A, Thiele O. 1998. A branch and bound algorithm for the resource constrained project scheduling problem. Eur J Oper Res. 107:272–288.
  • Chen PH, Weng H. 2009. A two-phase GA model for resource-constrained project scheduling. Autom Constr. 18:485–498.
  • Chen RM. 2011. Particle swarm optimization with justification and designed mechanisms for resource – constrained project scheduling problem. Expert Syst Appl. 38:7102–7111.
  • Cheng CH. 1998. A new approach for ranking fuzzy numbers by distance method. Fuzzy Sets Syst. 95:307–317.
  • Demeulemeester E, Herroelen W. 2000. The discrete time/resource trade-off problem in project networks: a branch-and-bound approach. IIE Trans. 32:1059–1069.
  • Demeulemeester E, Herroelen W. 2002. Project scheduling–a research handbook. Int Ser Oper Res Manage Sci. 49:13–70.
  • Demeulemeester EL, Herroelen WS, Elmaghraby SE. 1996. Optimal procedures for the discrete time/cost trade-off problem in project networks. Eur J Oper Res. 88:50–68.
  • De Reyck B, Herroelen W. 1998. A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. Eur J Oper Res. 111:152–174.
  • Duan Q, Liao TW. 2010. Improved ant colony optimization algorithms for determining project critical paths. Autom Constr. 19:676–693.
  • Fang C, Wang L. 2012. An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem. Comput Oper Res. 39:890–901.
  • Geekie A, Steyn H. 2008. Buffer sizing for the critical chain project management method. S Afr J Ind Eng. 19:73–88.
  • Ghaffari M, Emsley MW. 2015. Current status and future potential of the research on Critical Chain Project Management. Surveys Oper Res Manage Sci. 20:43–54.
  • Goldratt EM. 1997. Critical chain: a business novel. Great Barrington (MA): The North River Press.
  • Goldratt EM, Cox J. 1984. The goal. Great Barrington (MA): The North River Press.
  • Hall NG. 2015. Further research opportunities in project management. In: Schwindt C, Zimmermann J, editors. Handbook on project management and scheduling. Vol. 2. New York: Springer; p. 945–970.
  • Heilmann R. 2003. A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags. Eur J Oper Res. 144:384–365.
  • Horroelen W, Leus R. 2001. On the merit and pitfalls of critical chain scheduling. J Oper Manage. 19:559–577.
  • Kaufman A, Gupta M. 1985. Introduction to fuzzy arithmetic: theory and applications. New York (NY): Van Nostrand Reinhold Company.
  • Klein R. 1999. Scheduling of resource-constrained projects. Vol. 10. Dordrecht: Kluwer Academic Publishers.
  • Kokoskie G. 2001. A comparison of critical chain project management (CCPM) buffer sizing techniques. Fairfax (VA): George Mason University.
  • Kolisch R. 2013. Project scheduling under resource constraints: efficient heuristics for several problem classes. Heidelberg: Springer Science & Business Media.
  • Lawrence K. 1988. Resource–constrained project scheduling with preemption of jobs [PhD dissertation]. Ann Arbor:University of Michigan.
  • Leach LP. 2005. Critical chain project management. Norwood (MA): Artech House Inc.
  • Leach LP. 2014. Critical chain project management. Boston (MA): Artech House Inc.
  • Lee ES, Li RJ. 1988. Comparison of fuzzy numbers based on the probability measure of fuzzy events. Comput Math Appl. 15:887–896.
  • Long LD, Ohsato A. 2008. Fuzzy critical chain method for project scheduling under resource constraints and uncertainty. Int J Project Manage. 26:688–698.
  • Mingozzi A, Maniezzo V, Ricciardelli S, Bianco L. 1998. An exact algorithm for the resource constrained project scheduling problem based on a new mathematical formulation. Manage Sci. 44:714–729.
  • Newbold RC. 1998. Project management in the fast lane: applying the theory of constraints. New York (NY): St. Lucie Press.
  • Olaguibel RAV, Goerlich JT. 1993. The project scheduling polyhedron: dimension, facets and lifting theorems. Eur J Oper Res. 67:204–220.
  • Pan NH, Hsaio PW, Chen KY. 2008. A study of project scheduling optimization using Tabu Search algorithm. Eng Appl Artif Intell. 21:1101–1112.
  • PMI. 2008. A guide to the project management body of knowledge (PMBOK®). Newtown Square (PA): Project Management Institute, Inc.
  • Pritsker AAB, Watters LJ, Wolfe PM. 1969. Multi project scheduling with limited resources: a zero–one programming approach. Manage Sci. 16:93–108.
  • Rand GK. 2000. Critical chain: the theory of constraints applied to project management. Int J Project Manage. 18:173–177.
  • Ranjbar M, De Reyck B, Kianfar F. 2009. A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling. Eur J Oper Res. 193:35–48.
  • Roghanian E, Alipour M. 2014. A fuzzy model for achieving lean attributes for competitive advantages development using AHP-QFD-PROMETHEE. J Ind Eng Int. 10:1–11.
  • Shi Q, Gong T. 2009. An improved project buffer buffer sizing approach to critical chain management under resources constraints and fuzzy uncertainty. International Conference on Artificial Intelligence and Computational Intelligence; Shanghai, China.
  • Tukel OI, Rom WO, Eksioglu SD. 2006. An investigation of buffer sizing techniques in critical chain scheduling. Eur J Oper Res. 172:401–416.
  • Valls V, Ballestin F, Quintanilla S. 2008. A hybrid genetic algorithm for the resource-constrained project scheduling problem. Eur J Oper Res. 185:495–508.
  • 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:166–177.
  • Zhang H, Li X, Li H, Huang F. 2005. Particle swarm optimization-based schemes for resource-constrained project scheduling. Autom Constr. 14:393–404.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.