What is the Critical Path?

The critical path (English: Critical Path) is the longest chain of time-dependent activities in a project. It determines the minimum project duration -- the project cannot be completed faster than the critical path dictates.

What's special about activities on the critical path: They have no buffer time. If a critical activity takes three days longer than planned, the project end date shifts by exactly three days. Non-critical activities, on the other hand, have a buffer -- they can be delayed within this buffer without jeopardizing the project end date.

For project managers, the critical path is therefore one of the most important planning tools: It shows where delays directly threaten the project and where there is leeway. In combination with a Gantt chart, the project structure becomes visually tangible.

Historical Background

The Critical Path Method (CPM) was developed in 1957 by the US companies DuPont and Remington Rand for planning plant maintenance projects. Almost simultaneously, the PERT method (Program Evaluation and Review Technique) was created for the US Navy's Polaris missile program. Both methods form the basis of modern network planning and are still part of the PMBOK Guide (PMI) and DIN 69900 today.

The Critical Path Method (CPM) Explained

CPM is based on a network diagram that maps all activities of a project, their duration, and their dependencies. From this network diagram, the earliest and latest times for each activity are determined through forward and backward pass calculations.

The central terms of CPM are:

Core Rule: All activities whose total float is zero (TF = 0) lie on the critical path. They must not be delayed.

The Critical Path — Visualized

The longest path through the network determines the minimum project duration. Delays on this path delay the entire project.

Network Diagram with Critical Path Start W0 A: Planning 3 Weeks B: Research 2 Weeks C: Development 5 Weeks D: Design 3 Weeks E: Testing 2 Weeks F: Docs 1 Week End W10 Float: 2 Weeks Critical Path: A → C → E = 10 Weeks Critical Path (no float) Non-critical (has float)

The Critical Path (red) determines the minimum duration of 10 weeks. Non-critical tasks (gray) have float time.

Calculating the Critical Path: Step-by-Step

1

Create Activity List

List all project activities with their duration and their dependencies (predecessors). Each activity must have at least one predecessor, except for the start activity.

2

Forward Pass

Calculate for each activity the earliest start (ES) and the earliest finish (EF), starting with the first activity with ES = 0. The formula: EF = ES + Duration. If an activity has multiple predecessors, its ES is equal to the maximum of all EF values of the predecessors.

3

Backward Pass

Calculate for each activity the latest finish (LF) and the latest start (LS), starting with the last activity. The LF of the last activity corresponds to its EF from the forward pass. The formula: LS = LF - Duration. If an activity has multiple successors, its LF is equal to the minimum of all LS values of the successors.

4

Calculate Float and Identify the Critical Path

Calculate the Total Float: TF = LS - ES (or equivalently: LF - EF). All activities with TF = 0 lie on the critical path. Connect these activities -- they form the longest path through the network diagram.

Practical Example: Website Relaunch

A company plans a website relaunch with six activities. The goal is a complete project plan with an identified critical path and defined milestones.

Activity List

Activity Description Duration (Days) Predecessor
ARequirements Analysis5--
BUX Design8A
CContent Creation6A
DFrontend Development10B
EBackend Development12B
FTesting & Go-Live4C, D, E

Forward Pass

Earliest Dates (ES → EF) A: ES=0, EF=0+5=5
B: ES=5, EF=5+8=13
C: ES=5, EF=5+6=11
D: ES=13, EF=13+10=23
E: ES=13, EF=13+12=25
F: ES=max(11,23,25)=25, EF=25+4=29 Project duration: 29 days. F waits for the latest predecessor (E, Day 25).

Backward Pass

Latest Dates (LF → LS) F: LF=29, LS=29-4=25
E: LF=25, LS=25-12=13
D: LF=25, LS=25-10=15
C: LF=25, LS=25-6=19
B: LF=min(15,13)=13, LS=13-8=5
A: LF=min(5,19)=5, LS=5-5=0 B has two successors (D and E). The LF of B is the minimum of the LS values of D (15) and E (13) = 13.

Float and Critical Path

Activity Duration ES EF LS LF TF Critical?
A505050Yes
B85135130Yes
C6511192514No
D10132315252No
E12132513250Yes
F4252925290Yes
Result: The Critical Path is A → B → E → F

This path has a total duration of 5 + 8 + 12 + 4 = 29 days. Any delay on this path extends the project. Activity C has 14 days of float -- it could not start until day 19 without jeopardizing the go-live date. Activity D has 2 days of float and is therefore "near-critical".

Advantages and Limitations of the Method

Advantages of CPM

Limitations of CPM

Critical Path in Practice: Tools and Software

Various tools are available for calculating the critical path. The choice depends on project size and complexity:

How PathHub AI Considers the Critical Path

PathHub AI generates project plans with clearly defined phases, tasks, and dependencies. In doing so, the AI automatically considers the logical sequence of tasks and estimates realistic durations.

Project Plans with Automatic Phase Planning

PathHub AI creates project plans with realistic time estimates and logical dependencies -- in minutes instead of hours.

Start for Free

Frequently Asked Questions

The critical path is the longest sequence of dependent tasks in a project. It determines the minimum project duration -- the project cannot be completed faster than the critical path lasts. Tasks on the critical path have no float: any delay of a critical task extends the entire project by exactly that amount of time.
The calculation is done in three steps: 1. Forward pass: Calculate the earliest start (ES) and earliest finish (EF) of each task, starting with the first task. 2. Backward pass: Calculate the latest start (LS) and latest finish (LF) of each task, starting with the last task. 3. Calculate float: TF = LS - ES. Tasks with a float of 0 lie on the critical path.
Total float (TF = LS - ES) indicates how long a task can be delayed without delaying the project end date. Free float (FF = ES of successor - EF of task) indicates how long a task can be delayed without affecting the earliest start of its immediate successor. Free float is always less than or equal to total float.
Yes, a project can have multiple critical paths if two or more paths have the same longest duration. In this case, all these paths are equally critical. This increases project risk because a delay on any of these paths would delay the project. During project execution, the critical path can also shift if tasks are completed faster or slower than planned.