Activities and Predecessors
Activities and Predecessors
H 13 H 15 15 13 2
5/28/12
22
Slack Time
Activity ES EF LS LF Slack LS-ES 0 1 0 1 0 6 0 0 On Critical Path Y N Y N Y N Y Y
33
A B C D E F G H
0 0 2 3 4 4 8 13
2 3 4 7 8 7 13 15
0 1 2 4 4 10 8 13
2 4 4 8 8 13 13 15
Exercise 1
Activiti Predece Duratio es ssor n A 4 B A 7 C A 8 D A 14 E B, C 5 F E 4 G D, E 6
44
A B C D E F G
5/28/12
A B B D C E,F
1 6 3 2 3 4 1
Network Solution
B A
1 6
D
2
E
3
G
1
C
3
F
4
5/28/12
EF = ES + Activity time
B A
1 6
D
2
E
3
G
1
C
3
F
4
B A
1 6
D
2
E
3
G
1
C
3
F
4
Begin at ending event & work backward LF = Maximum EF for ending activities
LS = LF - Activity time
B A 6
1 C 3
D E
2 3 G 1 F 4
13
D 2
G 1
Compute Slack
Activity A B C D E F G ES 0 1 1 7 9 4 12 EF 1 7 4 9 12 8 13 LS 0 1 5 7 9 8 12 LF 1 7 8 9 12 12 13 Slack 0 0 4 0 0 4 0
Exercise 2
Calculate the four times for each activity in order to determine the critical path and project duration.
Earliest Earliest Latest Finish Start (ES) Start (LS) (EF) 0 0 7 Latest Finish (LF) 7 Slack (LS-ES) 0-0=0 On the Critical Path? Yes
Activity A B C D E F G
Duration 7 2 4 4 4 3 5
Calculate the four times for each activity in order to determine the critical path and project duration.
Earliest Earliest Latest Finish Start (ES) Start (LS) (EF) 0 0 7 7 7 11 15 19 19 9 7 11 15 21 19 9 11 15 19 22 24 Latest Finish (LF) 7 11 11 15 19 24 24 Slack (LS-ES) 0-0=0 9-7=2 7-7=0 11-11=0 15-15=0 21-19=2 19-19=0 On the Critical Path? Yes No Yes Yes Yes No Yes
Activity A B C D E F G
Duration 7 2 4 4 4 3 5
Activity A B C D E F G
Duration 7 2 4 4 4 3 5
On the Slack (LS- Critical ES) Path? 0-0=0 Yes 9-7=2 7-7=0 11-11=0 15-15=0 21-19=2 19-19=0 No Yes Yes Yes No Yes
5/28/12
Activity A B C D E F G
Duration 7 2 4 4 4 3 5
On the Slack (LS- Critical ES) Path? 0-0=0 Yes 9-7=2 7-7=0 11-11=0 15-15=0 21-19=2 19-19=0 No Yes Yes Yes No Yes
5/28/12