View source for Critical path method

{{Short description|Method of scheduling activities}}
{{Refimprove|date=May 2009}}
{{Use mdy dates|date=September 2016}}
{{Use American English|date=September 2016}}

[[File:Pert chart colored.svg|thumb|[[Program Evaluation and Review Technique|PERT]] chart for a project with five [[Milestone (project management)|milestones]] (10 through 50) and six activities (A through F). The project has two critical paths: activities B and C, or A, D, and F – giving a minimum project time of 7 months with fast tracking. Activity E is sub-critical, and has a [[Float (project management)|float]] of 1 month.]]

The '''critical path method''' ('''CPM'''), or '''critical path analysis''' ('''CPA'''), is an [[algorithm]] for [[schedule (project management)|scheduling]] a set of project activities.<ref>{{cite book
  | last  = Kelley
  | first = James
  | title = Critical Path Planning
  }}</ref> A critical path is determined by identifying the longest stretch of dependent activities and measuring the time<ref>{{Cite web|url=https://web.stanford.edu/class/cee320/CEE320B/CPM.pdf|title=Critical Path Method|last=Santiago|first=Jesse|date=4 February 2009|website=Stanford|access-date=October 24, 2018|archive-date=October 24, 2018|archive-url=https://web.archive.org/web/20181024032348/http://web.stanford.edu/class/cee320/CEE320B/CPM.pdf|url-status=dead}}</ref> required to complete them from start to finish. It is commonly used in conjunction with the [[program evaluation and review technique]] (PERT).

== History ==
The CPM is a project-modeling technique developed in the late 1950s by Morgan R. Walker of [[DuPont]] and James E. Kelley Jr. of [[Remington Rand]].<ref>{{cite book |doi=10.1145/1460299.1460318 |chapter=Critical-path planning and scheduling |title=Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference on - IRE-AIEE-ACM '59 (Eastern) |date=1959 |last1=Kelley |first1=James E. |last2=Walker |first2=Morgan R. |pages=160–173 |isbn=978-1-4503-7868-0 }}</ref> Kelley and Walker related their memories of the development of CPM in 1989.<ref>{{cite journal
  | last1      = Kelley
  | first1     = James
  | last2     = Walker
  | first2    = Morgan
  | title     = The Origins of CPM: A Personal History
  | journal   = The PM Net Work
  | date = 1989
 | volume    = 3
  | issue     = 2
  | pages     = 7–22
  | url       = https://books.google.com/books?id=jS9aAAAAYAAJ
  }}</ref> Kelley attributed the term "critical path" to the developers of the PERT, which was developed at about the same time by [[Booz Allen Hamilton]] and the [[U.S. Navy]].<ref>{{cite book |last1=Newell |first1=Michael W. |last2=Grashina |first2=Marina N. |title=The Project Management Question and Answer Book |date=2004 |publisher=AMACOM, American Management Association |isbn=978-0-8144-7164-7 |page=98 }}</ref> The precursors of what came to be known as critical path were developed and put into practice by DuPont between 1940 and 1943 and contributed to the success of the [[Manhattan Project]].<ref>{{cite book |doi=10.1061/9780784401606 |title=Management of the Hanford Engineer Works in World War II |date=1996 |last1=Thayer |first1=Harry |isbn=978-0-7844-0160-6 |pages=66–67 }}</ref>

Critical path analysis is commonly used with all forms of projects, including construction, aerospace and defense, software development, research projects, product development, engineering, and plant maintenance, among others. Any project with interdependent activities can apply this method of mathematical analysis. CPM was used for the first time in 1966 for the major skyscraper development of constructing the former [[World Trade Center Twin Towers]] in New York City. Although the original CPM program and approach is no longer used,<ref>A Brief History of Scheduling: [http://www.mosaicprojects.com.au/PDF_Papers/P042_History%20of%20Scheduing.pdf mosaic projects.com.au] {{Webarchive|url=https://web.archive.org/web/20150518071346/http://www.mosaicprojects.com.au/PDF_Papers/P042_History%20of%20Scheduing.pdf |date=May 18, 2015 }}</ref> the term is generally applied to any approach used to analyze a project network logic diagram.

== Basic techniques ==
=== Components ===
The essential technique for using CPM<ref>Samuel L. Baker, Ph.D. [http://hspm.sph.sc.edu/COURSES/J716/CPM/CPM.html "Critical Path Method (CPM)"] {{web archive |url=https://web.archive.org/web/20100612142236/http://hspm.sph.sc.edu/COURSES/J716/CPM/CPM.html |date=June 12, 2010}} ''University of South Carolina'', Health Services Policy and Management Courses</ref><ref>{{cite book
  | last      = Armstrong-Wright, MICE
  | first     = A. T.
  | title     = Critical Path Method: Introduction and Practice
  | publisher = Longman Group LTD |location=London |date=1969 |page=5ff
  }}</ref> is to construct a model of the project that includes:
# A list of all activities required to complete the project (typically categorized within a [[work breakdown structure]])
# The time (duration) that each activity will take to complete
#The dependencies between the activities
# Logical end points such as milestones or [[deliverable]] items

Using these values, CPM calculates the [[longest path]] of planned activities to logical end points or to the end of the project, and the earliest and latest that each activity can start and finish without making the project longer. This process determines which activities are "critical" (i.e., on the longest path) and which have no float/slack or "total float" zero (i.e., can not be delayed without making the project longer). In project management, a critical path is the sequence of project network activities that adds<!-- sequence is singular --> up to the longest overall duration, regardless of whether that longest duration has float or not. This determines the shortest time possible to complete the project. "Total float" (unused time) can occur within the critical path. For example, if a project is testing a solar panel and [[Task (project management)|task]] 'B' requires 'sunrise', a scheduling constraint on the testing activity could be that it would not start until the scheduled time for sunrise. This might insert dead time (total float) into the schedule on the activities on that path prior to the sunrise due to needing to wait for this event. This path, with the constraint-generated total float, would actually make the path longer, with total float being part of the shortest possible duration for the overall project. In other words, individual tasks on the critical path prior to the constraint might be able to be delayed without elongating the critical path; this is the total float of that task, but the time added to the project duration by the constraint is actually [[critical path drag]], the amount by which the project's duration is extended by each critical path activity and constraint.

A project can have several, parallel, near-critical paths, and some or all of the tasks could have free float and/or total float. An additional parallel path through the network with the total durations shorter than the critical path is called a subcritical or noncritical path. Activities on subcritical paths have no drag, as they are not extending the project's duration.

CPM analysis tools allow a user to select a logical end point in a project and quickly identify its longest series of dependent activities (its longest path). These tools can display the critical path (and near-critical path activities if desired) as a cascading waterfall that flows from the project's start (or current status date) to the selected logical end point.

=== Visualizing critical path schedule ===
Although the activity-on-arrow diagram (PERT chart) is still used in a few places, it has generally been superseded by the activity-on-node diagram, where each activity is shown as a box or node and the arrows represent the logical relationships going from predecessor to successor as shown here in the "Activity-on-node diagram".
[[File:Activity-on-node-v3.svg|alt=|thumb|''Activity-on-node diagram'' showing critical path schedule, along with total float and critical path drag computations]]
In this diagram, Activities A, B, C, D, and E comprise the critical or longest path, while Activities F, G, and H are off the critical path with floats of 15 days, 5 days, and 20 days respectively. Whereas activities that are off the critical path have float and are therefore not delaying completion of the project, those on the critical path will usually have critical path drag, i.e., they delay project completion. The drag of a critical path activity can be computed using the following formula:
# If a critical path activity has nothing in parallel, its drag is equal to its duration. Thus A and E have drags of 10 days and 20 days respectively.
# If a critical path activity has another activity in parallel, its drag is equal to whichever is less: its duration or the total float of the parallel activity with the least total float. Thus since B and C are both parallel to F (float of 15) and H (float of 20), B has a duration of 20 and drag of 15 (equal to F's float), while C has a duration of only 5 days and thus drag of only 5. Activity D, with a duration of 10 days, is parallel to G (float of 5) and H (float of 20) and therefore its drag is equal to 5, the float of G.

These results, including the drag computations, allow managers to prioritize activities for the effective management of project, and to shorten the planned critical path of a project by pruning critical path activities, by "fast tracking" (i.e., performing more activities in parallel), and/or by "crashing the critical path" (i.e., shortening the durations of critical path activities by adding [[Resource (project management)|resources]]).

Critical path drag analysis has also been used to optimize schedules in processes outside of strict project-oriented contexts, such as to increase manufacturing throughput by using the technique and metrics to identify and alleviate delaying factors and thus reduce assembly lead time.<ref>{{cite thesis |last1=Sedore |first1=Blake William Clark |title=Assembly lead time reduction in a semiconductor capital equipment plant through constraint based scheduling |date=2014 |hdl=1721.1/93851 |hdl-access=free }}{{pn|date=July 2024}}</ref>

=== Crash duration ===
"Crash duration" is a term referring to the shortest possible time for which an activity can be scheduled.<ref>{{cite book
 |title= Project Management for Construction |chapter = 11. Advanced Scheduling Techniques |first1 = Chris |last1= Hendrickson |author-link1= Chris T. Hendrickson |publisher= Prentice Hall |isbn = 978-0-13-731266-5 |year= 2008 |last2= Tung |first2= Au |url= http://pmbook.ce.cmu.edu/
|chapter-url = http://pmbook.ce.cmu.edu/11_Advanced_Scheduling_Techniques.html |access-date= October 27, 2011 |edition = 2.2
|archive-url=https://web.archive.org/web/20170324031153/http://pmbook.ce.cmu.edu/ |archive-date = March 24, 2017 |url-status = dead
}}</ref> It can be achieved by shifting more resources towards the completion of that activity, resulting in decreased time spent and often a reduced quality of work, as the premium is set on speed.<ref>{{cite book
  | last      = Brooks
  | first     = F.P.
  | title     = The Mythical Man-Month
  | url      = https://archive.org/details/mythicalmanmonth00broo
  | url-access = registration
  | year      = 1975
  | publisher = Addison Wesley
  | location  = Reading, MA
  | isbn = 978-0-201-00650-6
 }}{{pn|date=July 2024}}</ref>
Crash duration is typically modeled as a linear relationship between cost and activity duration, but in many cases, a [[convex function]] or a [[step function]] is more applicable.<ref>{{cite journal
  | last    = Hendrickson
  | first   = C.
  | author2 = B.N. Janson
  | title   = A Common Network Flow Formulation for Several Civil Engineering Problems
  | journal = Civil Engineering Systems
  | year    = 1984
  | volume  = 1
  | series  = 4
  | issue = 4
 | pages   = 195–203
  | doi = 10.1080/02630258408970343
 | bibcode = 1984CEngS...1..195H
 }}</ref>

=== Expansion ===
{{unreferenced section |date=April 2018}}
Originally, the critical path method considered only logical [[Dependency (project management)|dependencies]] between terminal elements. Since then, it has been expanded to allow for the inclusion of resources related to each activity, through processes called activity-based resource assignments and resource optimization techniques such as [[Resource Leveling]] and [[Resource smoothing]]. A resource-leveled schedule may include delays due to resource bottlenecks (i.e., unavailability of a resource at the required time), and may cause a previously shorter path to become the longest or most "resource critical" path while a resource-smoothed schedule avoids impacting the critical path by using only free and total float.<ref>{{cite book
|title=A Guide to the Project Management Body of Knowledge (PMBOK® Guide)
|page=720
|chapter=6.5.2.3 Resource Optimization 
|edition=6th
|isbn=978-1-62825-382-5
|date=2017
|publisher=[[Project Management Institute]]
}}</ref> A related concept is called the [[critical chain]], which attempts to protect activity and project durations from unforeseen delays due to resource constraints.

Since project schedules change on a regular basis, CPM allows continuous monitoring of the schedule, which allows the [[project manager]] to track the critical activities, and alerts the project manager to the possibility that non-critical activities may be delayed beyond their total float, thus creating a new critical path and delaying project completion. In addition, the method can easily incorporate the concepts of stochastic predictions, using the PERT and [[event chain methodology]].

=== Flexibility ===
A schedule generated using the critical path techniques often is not realized precisely, as [[Estimation (project management)|estimations]] are used to calculate times: if one mistake is made, the results of the analysis may change. This could cause an upset in the implementation of a project if the estimates are blindly believed, and if changes are not addressed promptly. However, the structure of critical path analysis is such that the variance from the original schedule caused by any change can be measured, and its impact either [[:wikt:ameliorated|ameliorated]] or adjusted for. Indeed, an important element of project postmortem analysis is the 'as built critical path' (ABCP), which analyzes the specific causes and impacts of changes between the planned schedule and eventual schedule as actually implemented.

==Usage==
Critical path techniques are widely used in planning, managing and controlling the delivery of [[construction]] projects. A technique known as "as-built critical path analysis" can also be used to assess the causes of a [[construction delay |delay in completing a project]], especially where there may have been more than one delaying factor and liability needs to be established for compensation and [[damages]] purposes. However, the use of as-built CPA in a legal context has been criticised, for example in the [[Courts of Scotland|Scottish court]] case of ''City Inn Ltd. v Shepherd Construction'' (2007).<ref>Pease, I., [http://www.primafacie.biz/resources/articles/080121-plj202-p11-14.pdf Delaying tactics], ''Property Law Journal'', published on 21 January 2008, accessed on 5 December 2024</ref>

Currently, there are several [[software]] solutions available in industry which use the CPM method of scheduling; see [[list of project management software]]. The method currently used by most project management software is based on a manual calculation approach developed by Fondahl of Stanford University.{{cn|date=December 2024}}

== In popular culture ==
* In ''[[Odds On]]'', the first novel by [[Michael Crichton]], robbers use a critical path computer program to help plan a heist.
* ''[[The Nome Trilogy]]'' (in the first book, ''Truckers'') by [[Terry Pratchett]] mentions "something called ''critical path analysis''" and says that it means "there's always something you should have done first."

== See also ==
* [[Gantt chart]]
* [[Graphical Evaluation and Review Technique]]
* [[Program evaluation and review technique]]
* [[Critical chain project management]]
* [[Liebig's law of the minimum]]
* [[List of project management software]]
* [[List of project management topics]] 
* [[Main path analysis]]
* [[Project management]]
* [[Project planning]]
* [[Work breakdown structure]]

== References ==

{{Reflist|30em}}

== Further reading ==
{{div col|colwidth=30em}}
* {{cite book
  | author    = Emmanuel Asanga
  | title     = A Guide To The Project Management Body Of Knowledge
  | year      = 2013
  | edition   = 5th
  | publisher = Project Management Institute
  | isbn      = 978-1-935589-67-9
  }}
* {{cite book
  | first     = Stephen A.
  | last      = Devaux
  | year      = 2014
  | title     = Managing Projects as Investments: Earned Value to Business Value
  | publisher = CRC Press
  | isbn      = 978-1-4822-1270-9
  }}
* {{cite book
  | first     = Stephen A.
  | last      = Devaux
  | year      = 2015
  | title     = Total Project Control (2nd Edition): A Practitioner's Guide to Managing Projects as Investments
  | publisher = CRC Press
  | isbn      = 978-1-4987-0677-3
  }}
* {{cite book
  | first       = Gary
  | last       = Heerkens
  | year       = 2001
  | title       = Project Management (The Briefcase Book Series)
  | publisher       = McGraw–Hill
  | isbn       = 0-07-137952-5
  | url-access       = registration
  | url       = https://archive.org/details/projectmanagemen00gary
  }}
* {{cite book
  | first      = Harold
  | last       = Kerzner
  | author-link = Harold Kerzner
  | year       = 2003
  | title      = Project Management: A Systems Approach to Planning, Scheduling, and Controlling
  | publisher = Wiley
 | url      = https://archive.org/details/projectmanagemen0000kerz_h0w8
  | url-access = registration
  | edition    = 8th
  | isbn       = 0-471-22577-0
  }}
* {{cite book
  | first     = Ozhan
  | last      = Atali
  | title     = Data-Driven Project Management: Spreadsheets and Finance
  | year      = 2020
  | publisher = [[Wremia]] Project Management
  | isbn      = 978-0-578-67030-0
  }}
* {{cite book
  | first     = Ted
  | last      = Klastorin
  | title     = Project Management: Tools and Trade-offs
  | year      = 2003
  | edition   = 3rd
  | publisher = Wiley
  | isbn      = 978-0-471-41384-4
  }}
* {{cite book
  | first      = James
  | last      = Lewis
  | year      = 2002
  | title      = Fundamentals of Project Management
  | edition      = 2nd
  | publisher      = American Management Association
  | isbn      = 0-8144-7132-3
  | url-access      = registration
  | url      = https://archive.org/details/fundamentalsofpr00lewi_1
  }}
* {{cite book
  | last1     = Malakooti
  | first1    = B
  | title     = Operations and Production Systems with Multiple Objectives
  | date      = 2013
  | publisher = John Wiley & Sons
  | isbn      = 978-1-118-58537-5
  }}
* {{cite book
  | first     = Dragan Z.
  | last      = Milosevic
  | year      = 2003
  | title     = Project Management ToolBox: Tools and Techniques for the Practicing Project Manager
  | publisher = Wiley
  | isbn      = 978-0-471-20822-8
  }}
* {{cite book
  | first1     = James J.
  | last1      = O'Brien
  | first2    = Fredric L.
  | last2     = Plotnick
  | year      = 2010
  | title     = CPM in Construction Management, Seventh Edition
  | publisher = McGraw Hill
  | isbn      = 978-0-07-163664-3
  }}
* {{cite book
  | last1     = Trauner
  | last2     = Manginelli
  | last3     = Lowe
  | last4     = Nagata
  | last5     = Furniss
  | title     = Construction Delays, 2nd Ed.: Understanding Them Clearly, Analyzing Them Correctly
  | year      = 2009
  | publisher = Elsevier
  | location  = Burlington, MA
  | isbn      = 978-1-85617-677-4
  | page      = 266
  }}
* {{cite book
  | first     = Murray B.
  | last      = Woolf
  | year      = 2012
  | title     = CPM Mechanics: The Critical Path Method of Modeling Project Execution Strategy
  | publisher = ICS-Publications
  | isbn      = 978-0-9854091-0-4
  }}
* {{cite book
  | first     = Murray B.
  | last      = Woolf
  | year      = 2007
  | title     = Faster Construction Projects with CPM Scheduling
  | publisher = McGraw Hill
  | isbn      = 978-0-07-148660-6
  }}
{{div col end}}
{{Schedule network analysis}}

== External links ==
* {{commonscat-inline|CPM diagrams}}

{{Authority control}}

[[Category:Business terms]]
[[Category:Network theory]]
[[Category:Project management techniques]]
[[Category:Scheduling algorithms]]
[[Category:Schedule (project management)]]