Determining Critical Path and Activity Slack (2 pts.)
Assume we have a set of activities, their expected durations, and immediate predecessors.
Construct an activity network; identify the critical path and all activity slack times.
Activity
Duration
Predecessors
Free Slack
Total Slack
A
6
--
B
7
A
C
5
A
D
3
B
E
4
C
F
5
C
G
8
D, E
H
3
F, G
A) Critical Path (A - B - D - G - H)
Free Slack (C = 0d, E = 1d, F = 8d)
Total Slack (C = 1d, E = 1d, F = 8d)
B) Critical Path (A - B - D - G)
Free Slack (C = 0d, E = 1d, F = 8d, H = 0d)
Total Slack (C = 1d, E = 1d, F = 8d, H = 1d)
C) Critical Path (C - E - F)
Free Slack (C = 0d, E = 1d, F = 8d)
Total Slack (C = 1d, E = 1d, F = 8d)
D) Critical Path (A - B - C - D - G - H)
Free Slack (C = 0d, E = 1d, F = 6d)
Total Slack (C = 1d, E = 1d, F = 6d)