Skip to main content
Top

2013 | OriginalPaper | Chapter

3. The Critical Path Method

Author : Mario Vanhoucke

Published in: Project Management with Dynamic Scheduling

Publisher: Springer Berlin Heidelberg

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This chapter makes an effort to tighten the gap between the project scheduling literature and the needs of project managers and schedulers through the use of a practical computerized simulation game. Project managers are constantly confronted with the intricacy of scheduling a complex real-life problem in an efficient way when they often have little knowledge of the state-of-the-art in the algorithmic developments or inherent characteristics of the scheduling problem they solve. A game has been developed that serves as a training tool to help practitioners gain insight in project scheduling. The well-known critical path method (CPM) with activity time/cost trade-offs is introduced to the reader, and used as a project scheduling technique in the game.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
Note that this classification can be subject to discussion. The discrete time/cost trade-off problem as discussed in Sect. 3.2.2 is known to be NP-hard, and hence, constructing an optimal schedule for this scheduling problem is known to be a very difficult problem. However, due to the absence of renewable resources, the problem is considered as easy (quadrant 1 of Fig. 1.​4) relative to the resource-constrained projects of quadrant 3. Details are outside the scope of this book.
 
2
Data based on figures obtained in 2003.
 
3
The default project network is based on the project discussed in Chap.​ 4 but duration and cost combinations changed to other settings to model the time/cost trade-offs.
 
4
No panic, it is only a game!
 
Literature
go back to reference Billstein N, Radermacher F (1977) Time-cost optimization. Method Oper Res 27:274–294 Billstein N, Radermacher F (1977) Time-cost optimization. Method Oper Res 27:274–294
go back to reference Brucker P, Drexl A, Möhring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: notation, classification, models, and methods. Eur J Oper Res 112:3–41CrossRef Brucker P, Drexl A, Möhring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: notation, classification, models, and methods. Eur J Oper Res 112:3–41CrossRef
go back to reference Crowston W, Thompson G (1967) Decision CPM: a method for simultaneous planning, scheduling and control of projects. Oper Res 15:407–426CrossRef Crowston W, Thompson G (1967) Decision CPM: a method for simultaneous planning, scheduling and control of projects. Oper Res 15:407–426CrossRef
go back to reference De P, Dunne E, Ghosh J, Wells C (1995) The discrete time-cost tradeoff problem revisited. Eur J Oper Res 81:225–238CrossRef De P, Dunne E, Ghosh J, Wells C (1995) The discrete time-cost tradeoff problem revisited. Eur J Oper Res 81:225–238CrossRef
go back to reference De P, Dunne E, Ghosh J, Wells C (1997) Complexity of the discrete time/cost trade-off problem for project networks. Oper Res 45:302–306CrossRef De P, Dunne E, Ghosh J, Wells C (1997) Complexity of the discrete time/cost trade-off problem for project networks. Oper Res 45:302–306CrossRef
go back to reference Delisle C, Olson D (2004) Would the real project management language please stand up? Int J Proj Manag 22:327–337CrossRef Delisle C, Olson D (2004) Would the real project management language please stand up? Int J Proj Manag 22:327–337CrossRef
go back to reference Demeulemeester E, Herroelen W (1996) An efficient optimal solution for the preemptive resource-constrained project scheduling problem. Eur J Oper Res 90:334–348CrossRef Demeulemeester E, Herroelen W (1996) An efficient optimal solution for the preemptive resource-constrained project scheduling problem. Eur J Oper Res 90:334–348CrossRef
go back to reference Demeulemeester E, Herroelen W (2002) Project scheduling: a research handbook. Kluwer Academic Publishers, Boston Demeulemeester E, Herroelen W (2002) Project scheduling: a research handbook. Kluwer Academic Publishers, Boston
go back to reference Demeulemeester E, De Reyck B, Foubert B, Herroelen W, Vanhoucke M (1998) New computational results on the discrete time/cost trade-off problem in project networks. J Oper Res Soc 49:1153–1163 Demeulemeester E, De Reyck B, Foubert B, Herroelen W, Vanhoucke M (1998) New computational results on the discrete time/cost trade-off problem in project networks. J Oper Res Soc 49:1153–1163
go back to reference Elmaghraby S (1977) Activity networks: project planning and control by network models. Wiley, New York Elmaghraby S (1977) Activity networks: project planning and control by network models. Wiley, New York
go back to reference Elmaghraby S (1995) Activity nets: a guided tour through some recent developments. Eur J Oper Res 82:383–408CrossRef Elmaghraby S (1995) Activity nets: a guided tour through some recent developments. Eur J Oper Res 82:383–408CrossRef
go back to reference Elmaghraby S, Kamburowsky R (1992) The analysis of activity networks under generalized precedence relations. Manag Sci 38:1245–1263CrossRef Elmaghraby S, Kamburowsky R (1992) The analysis of activity networks under generalized precedence relations. Manag Sci 38:1245–1263CrossRef
go back to reference Herroelen W, De Reyck B, Demeulemeester E (1998) Resource-constrained project scheduling: a survey of recent developments. Comput Oper Res 25:279–302CrossRef Herroelen W, De Reyck B, Demeulemeester E (1998) Resource-constrained project scheduling: a survey of recent developments. Comput Oper Res 25:279–302CrossRef
go back to reference Herroelen W, Demeulemeester E, De Reyck B (1999) A classification scheme for project scheduling problem. In: Weglarz J (ed) Project scheduling - Recent models, algorithms and applications. Kluwer Academic Publishers, Dortrecht, pp 1–26 Herroelen W, Demeulemeester E, De Reyck B (1999) A classification scheme for project scheduling problem. In: Weglarz J (ed) Project scheduling - Recent models, algorithms and applications. Kluwer Academic Publishers, Dortrecht, pp 1–26
go back to reference Hindelang T, Muth J (1979) A dynamic programming algorithm for decision CPM networks. Oper Res 27:225–241CrossRef Hindelang T, Muth J (1979) A dynamic programming algorithm for decision CPM networks. Oper Res 27:225–241CrossRef
go back to reference Icmeli O, Erenguc S, Zappe C (1993) Project scheduling problems: a survey. Int J Oper Prod Manag 13:80–91CrossRef Icmeli O, Erenguc S, Zappe C (1993) Project scheduling problems: a survey. Int J Oper Prod Manag 13:80–91CrossRef
go back to reference Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur J Oper Res 174:23–37CrossRef Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur J Oper Res 174:23–37CrossRef
go back to reference Kelley J, Walker M (1959) Critical path planning and scheduling: an introduction. Mauchly Associates, Ambler Kelley J, Walker M (1959) Critical path planning and scheduling: an introduction. Mauchly Associates, Ambler
go back to reference Kelley J (1961) Critical path planning and scheduling: mathematical basis. Oper Res 9:296–320CrossRef Kelley J (1961) Critical path planning and scheduling: mathematical basis. Oper Res 9:296–320CrossRef
go back to reference Özdamar L, Ulusoy G (1995) A survey on the resource-constrained project scheduling problem. IIE Trans 27:574–586CrossRef Özdamar L, Ulusoy G (1995) A survey on the resource-constrained project scheduling problem. IIE Trans 27:574–586CrossRef
go back to reference Patterson J (1979) An implicit enumeration algorithm for the time/cost trade-off problem in project network analysis. Found Control Eng 6:107–117 Patterson J (1979) An implicit enumeration algorithm for the time/cost trade-off problem in project network analysis. Found Control Eng 6:107–117
go back to reference Piper C (2005) Cpsim2: the critical path simulator (windows version). Richard Ivey School of Business, London Piper C (2005) Cpsim2: the critical path simulator (windows version). Richard Ivey School of Business, London
go back to reference Robinson D (1975) A dynamic programming solution to cost/time trade-off for CPM. Manag Sci 22:158–166CrossRef Robinson D (1975) A dynamic programming solution to cost/time trade-off for CPM. Manag Sci 22:158–166CrossRef
go back to reference Skutella M (1998) Approximation algorithms for the discrete time-cost tradeoff problem. Math Oper Res 23:909–929CrossRef Skutella M (1998) Approximation algorithms for the discrete time-cost tradeoff problem. Math Oper Res 23:909–929CrossRef
go back to reference Vanhoucke M, Vereecke A, Gemmel P (2005) The project scheduling game (PSG): simulating time/cost trade-offs in projects. Proj Manag J 51:51–59 Vanhoucke M, Vereecke A, Gemmel P (2005) The project scheduling game (PSG): simulating time/cost trade-offs in projects. Proj Manag J 51:51–59
go back to reference Walker M, Sawyer J (1959) Project planning and scheduling. Technical Report Report 6959, E.I. duPont de Nemours and Co., Wilmington Walker M, Sawyer J (1959) Project planning and scheduling. Technical Report Report 6959, E.I. duPont de Nemours and Co., Wilmington
go back to reference Wauters M, Vanhoucke M (2013) A study on complexity and uncertainty perception and solution strategies for the time/cost trade-off problem. Working Paper, Ghent University (submitted) Wauters M, Vanhoucke M (2013) A study on complexity and uncertainty perception and solution strategies for the time/cost trade-off problem. Working Paper, Ghent University (submitted)
go back to reference Wiest J, Levy F (1977) A management guide to PERT/CPM: with GERT/PDM/DCPM and other networks. Prentice-Hall, Inc, Englewood Cliffs Wiest J, Levy F (1977) A management guide to PERT/CPM: with GERT/PDM/DCPM and other networks. Prentice-Hall, Inc, Englewood Cliffs
Metadata
Title
The Critical Path Method
Author
Mario Vanhoucke
Copyright Year
2013
Publisher
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-642-40438-2_3