Lesson 6: Backward scanning, latest starting times and float
Backward scan and floats for the kitchen renovation
SkillsLatest starting timesFloat times
Worked example
Use a backward scan to find the LST of every activity in the kitchen renovation, then find the float of each activity.
Step 1: Finish (event 7)
Latest time = minimum completion time = 16. So has LST and has LST .
Step 2: Events 6 and 5
Event 6: only leaves, . So has LST . Event 5: gives and gives ; take the smallest, 12. So has LST .
Event 5 must happen in time for , the more urgent of the two activities leaving it.
Step 3: Events 4 and 3
Event 4: only leaves, . So has LST , has LST and has LST . Event 3: latest time , so has LST .
Step 4: Events 2 and 1
Event 2: gives , gives ; smallest 2. So has LST . Event 1: gives , gives ; smallest 0. ✓
The start event coming back to 0 is a check on the arithmetic.
Step 5: Calculate the floats
Float = LST − EST: 0, , 0, , 0, 0, 0, 0, .
Answer
LSTs (days): 0, 3, 2, 7, 5, 9, 12, 14, 13. Floats: 3, 5, 1; all others 0.
Try a similar one
A fresh question of the same kind, checked as you answer, with hints and a full solution.
Method
Finish event's latest time = minimum completion time.
At each event: smallest of (latest time at head − duration) over the arrows out.
LST of an activity = latest time at its end event − its duration.
Float = LST − EST.
Watch out for
Giving an LST of 2 (the latest time at its start event). That 2 belongs to .
Taking the largest value at event 5 (13), which would make late.