Critical paths and float
Studying this course? Keep your progress in one place.
Key facts
- A forward pass takes the largest value at each event; a backward pass takes the smallest.
- The earliest time at the finish event is the minimum project time.
- The critical path is the longest path. Critical activities have zero float.
- Total float .
- The lower bound for workers is total duration divided by project time, rounded up.
Earliest and latest times
A forward pass gives earliest times using the largest value; a backward pass gives latest times using the smallest.
The earliest event time comes from a forward pass: start with at the start event and at each event take the largest value of duration over the activities ending there.
The latest event time comes from a backward pass: set at the finish equal to its earliest time and at each event take the smallest value of duration over the activities leaving it.
at the finish event is the minimum project time.
| Forward pass | Backward pass | |
|---|---|---|
| Starts at | Start event, | Finish event, |
| Direction | Add durations | Subtract durations |
| At each event take | Largest value | Smallest value |
| Gives | Earliest times | Latest times |
Forward pass
- Starts at:
- Start event,
- Direction:
- Add durations
- At each event take:
- Largest value
- Gives:
- Earliest times
Backward pass
- Starts at:
- Finish event,
- Direction:
- Subtract durations
- At each event take:
- Smallest value
- Gives:
- Latest times
Two activities end at an event. They give values of 7 and 9 in a forward pass. What is at the event?
Start and finish times
For an activity from event to event , use and with the duration .
For an activity from event to event with duration :
- earliest start
- earliest finish
- latest finish
- latest start .
From a precedence table, the earliest start is the largest earliest finish of its immediate predecessors, and the latest finish is the smallest latest start of the activities that follow it.
- Earliest finish
- Latest start
Worked example
takes 4 days, takes 6, takes 3 (after and ). When does start earliest?
- 1
starts at 0 and finishes at 4.
- 2
starts at 0 and finishes at 6.
- 3
needs both, so it starts at the larger finish time, 6.
An activity has at its start event, at its end event and duration 4. What is its latest start?
The critical path
The critical path is the longest path from start to finish. Its length is the minimum project time.
An activity is critical if any delay to it delays the whole project. Its earliest start equals its latest start, and its earliest finish equals its latest finish.
The critical path is a path of critical activities from start to finish. It is the longest path, and its length is the minimum project time. There can be more than one critical path.
- 1
B
6 days
- 2
E
7 days
- 3
G
2 days
- 4
H
3 days
Worked example
The longest path is , , , with durations 6, 7, 2 and 3 days. What is the minimum project time?
- 1
Add the durations: .
- 2
This is the longest path, so , , and are critical.
Can a project have more than one critical path?
Total float
Total float is the delay an activity can take without delaying the project: . Critical activities have zero float.
The total float of an activity is the amount it can be delayed, or its duration extended, without delaying the project.
For an activity from to :
Critical activities have zero total float. An activity with float 2 can be delayed by up to 2 days with no effect; a longer delay delays the project by the excess, and the critical path may change.
- Total float
Worked example
Activity has at its start event, at its end event and duration 5. Find its total float.
- 1
Use .
- 2
.
An activity has float 2 and is delayed by 5 days. By how much is the project delayed?
Gantt charts and workers
Divide the total of all durations by the minimum project time and round up. This is only a lower bound.
A Gantt (cascade) chart shows each activity as a bar on a time axis, each needing one worker. Critical activities form a continuous line from time 0 to the project time. Other activities start at their earliest start, with spare time shown as float.
The lower bound for the number of workers needed to finish in the minimum time is the sum of all durations divided by the minimum project time, rounded up.
A schedule may need more workers.
- Workers needed, rounded up
Worked example
The durations total 42 days and the project takes 24 days. What is the lower bound for the number of workers?
- 1
Divide: .
- 2
A fraction of a worker is not possible, so round up.
The durations total 50 days and the project takes 20 days. What is the lower bound for workers?
Try an exam question
Activity runs from event 2 to event 5 and lasts 6 days. The earliest time of event 2 is 8 and the latest time of event 5 is 20. (a) Calculate the total float of . (b) The durations of all activities total 51 days and the minimum project time is 20 days. Find a lower bound for the number of workers.
[4 marks]
- [1]Total float duration.
- [1] days.
- [1].
- [1]Rounding up, at least 3 workers.
That's the notes covered.
Carry on to the next subtopic.
Try a question
What is the earliest start time of activity G?
1 mark, marked against the mark scheme
What is the earliest start time of activity G?
1 mark, marked against the mark scheme