Lesson 7: Critical paths and the minimum completion time
A project with two critical paths
SkillsCritical pathsFloat times
Worked example
For the school formal project, find the EST, LST and float of each activity, the critical path/s and the minimum completion time.
Step 1: Forward scan
, : EST 0. , (after ): EST 3. (after ): EST 2. (after ): . (after ): . (after , , ): . Finish: .
Step 2: Backward scan
: LST . : . : . : . : . : . : . : .
is followed by (LST 3) and (LST 10). It must finish in time for the more urgent one, .
Step 3: Floats
Every activity has LST = EST except : float weeks.
Step 4: Link the critical activities
The zero-float activities form two paths from start to finish: ––– () and ––– ().
Answer
ESTs: 0, 0, 3, 2, 3, 6, 9, 12. LSTs: the same, except 10. Only has float (7 weeks). The critical paths are ––– and –––, and the minimum completion time is 14 weeks.
Try a similar one
A fresh question of the same kind, checked as you answer, with hints and a full solution.
Method
Scan forward for ESTs and backward for LSTs.
Critical activities have float 0.
Join them into every start-to-finish path; check each totals the minimum completion time.
Watch out for
Stopping after finding one critical path. and also have zero float, which signals a second one.