Critical paths and float
Studying this course? Keep your progress in one place.
Key facts
- The forward pass gives earliest event times: at each event take the largest of ; the finish value is the minimum project duration.
- The backward pass gives latest event times: at each event take the smallest of ; the check is .
- Total float : the delay an activity can take without delaying the project.
- A critical activity has total float 0, and a critical path is a path of critical activities from start to finish.
- The critical path length equals the minimum project duration, and there can be more than one critical path.
The forward pass
Work forwards from event 1 at time 0. At each later event take the largest value of over the activities arriving, because all of them must be complete.
The earliest event time is the earliest time event can occur, so the earliest time any activity leaving it can start.
Work forwards. Set . For each later event, find for every activity or dummy arriving, and take the largest.
The value at the finish event is the minimum project duration. A dummy has duration 0.
- Earliest event time
Worked example
Using the network, find the earliest event times at events 2, 3, 4, 5 and 6.
- 1
.
- 2
(only A arrives).
- 3
(only B arrives).
- 4
Event 4 is reached by C and D, so .
- 5
(only E arrives).
- 6
Event 6 is reached by F and G, so .
Event 4 is reached by activities giving 9 and 7. What is e(4)?
The backward pass
Work backwards from the finish event, where . At each earlier event take the smallest value of over the activities leaving it.
The latest event time is the latest time event can occur without delaying the project.
Work backwards. Set at the finish event. For each earlier event, find for every activity or dummy leaving it, and take the smallest, so that every leaving activity still finishes on time.
A good check is . If it is not, there is an arithmetic error.
- Earliest e
- Latest l
| Earliest e | Latest l | |
|---|---|---|
| Event 1 | 0 | 0 |
| Event 2 | 3 | 5 |
| Event 3 | 5 | 5 |
| Event 4 | 9 | 11 |
| Event 5 | 9 | 9 |
| Event 6 | 14 | 14 |
Earliest e
- Event 1:
- 0
- Event 2:
- 3
- Event 3:
- 5
- Event 4:
- 9
- Event 5:
- 9
- Event 6:
- 14
Latest l
- Event 1:
- 0
- Event 2:
- 5
- Event 3:
- 5
- Event 4:
- 11
- Event 5:
- 9
- Event 6:
- 14
- Latest event time
Worked example
Continue the same network, with . Find the latest event times.
- 1
.
- 2
(G leaves event 5).
- 3
(F leaves event 4).
- 4
(D and E leave event 3).
- 5
(C leaves event 2).
- 6
(A and B leave event 1).
At an event with two leaving activities, which value do you take in the backward pass?
Start and finish times
From the event times, an activity from event to event with duration has four times: , , and .
For an activity from event to event with duration :
- earliest start
- earliest finish
- latest finish
- latest start
The difference between the latest and earliest start (or finish) is the activity's slack.
| Earliest | Latest | |
|---|---|---|
| Start | e(i) | l(j) − d |
| Finish | e(i) + d | l(j) |
Earliest
- Start:
- e(i)
- Finish:
- e(i) + d
Latest
- Start:
- l(j) − d
- Finish:
- l(j)
Worked example
Activity C goes from event 2 to event 4 and lasts 6 days, with and . Find its four times.
- 1
Earliest start .
- 2
Earliest finish .
- 3
Latest finish .
- 4
Latest start .
An activity ends at an event with l(j) = 20 and lasts 8 days. What is its latest start?
Total float
Total float is how much an activity can be delayed without delaying the project, assuming all other activities start as early as possible.
The total float of an activity is the time available between its earliest start and its latest finish, minus the time it needs.
For example, days, so D can start up to 4 days late.
Total float is never negative on a valid network.
- Total float
| e(i) | l(j) | Duration | Total float | |
|---|---|---|---|---|
| A | 0 | 5 | 3 | 2 |
| C | 3 | 11 | 6 | 2 |
| D | 5 | 11 | 2 | 4 |
e(i)
- A:
- 0
- C:
- 3
- D:
- 5
l(j)
- A:
- 5
- C:
- 11
- D:
- 11
Duration
- A:
- 3
- C:
- 6
- D:
- 2
Total float
- A:
- 2
- C:
- 2
- D:
- 4
An activity has e(i) = 4, l(j) = 15 and duration 7. What is its total float?
Critical activities and paths
A critical activity has total float 0, so any delay delays the project. The critical path is a path of critical activities, and its length is the minimum project duration.
An activity is critical if its total float is 0. It has no freedom.
The critical path is a path from start to finish made up of critical activities. To find it, carry out both passes, then find the activities with .
There can be more than one critical path. Dummies on a critical path are included.
- Critical activitytotal float = 0
- Critical path length= minimum project duration
Worked example
In the network above, find the critical path.
- 1
B: , so B is critical.
- 2
E: , so E is critical.
- 3
G: , so G is critical.
- 4
A, C and D have positive float, so they are not critical.
Which statement is true?
Try an exam question
The table shows the activities for a project. A: from event 1 to 2, 4 days. B: 1 to 3, 6 days. C: 2 to 4, 5 days. D: 3 to 4, 2 days. E: 4 to 5, 2 days. (a) Find the earliest and latest event times. (b) State the critical path. (c) Find the total float of activity B.
[4 marks]
- [1]Earliest times: e(2) = 4, e(3) = 6, e(4) = 9 (largest of 9 and 8), e(5) = 11.
- [1]Latest times: l(5) = 11, l(4) = 9, l(3) = 7, l(2) = 4, l(1) = 0.
- [1]The critical path is A, C, E, with length 11.
- [1]Float of B = l(3) − e(1) − 6 = 7 − 0 − 6 = 1.
That's the notes covered.
Carry on to the next subtopic.
Try a question
Carry out a forward pass. What is the earliest event time at event 4?
1 mark, marked against the mark scheme
Carry out a forward pass. What is the earliest event time at event 4?
1 mark, marked against the mark scheme