QUESTION

Draw networks for the following projects. In each case, calculate all earliest
and latest event times, and deduce the critical path(s).

Activity Prerequisites Duration

A - 6
B - 3
C - 5
D A 5
E B 2
F B 9
G B,C 3
H D,E 6
I F,G 1
J F,G,H 8
K I 4

Activity Prerequisites Duration

A - 4
B - 2
C - 3
D A 7
E C 3
F B,E 8
G D,E 3
H A,B,C 2

ANSWER

(a)

1
 ¨¥
(6,6)
§
2 ¦H
µ
¡ HHD,5
A,6 HH
j¨ ¥ H,6 - ¨(17,17)
¥
¡ (11,11)
¡ H
¡ © *
© §¦
5 §
7¦
© @ J,8
¡ ©©E,2
(3,8)
(0,0) ¨ ¥¡ B,3 - ¨ ¥
© µ
¡ @R¨ ¥
@
§¦ §¦ §
9¦
1 3 ¡
H
@ H HF,9 ¢̧ (25,25)
? HH µ
¡
j¨ ¥
@ ¡ ¢
H (12,17) ¢
@
© *§
© 6¦ ¢
@ ? © H
HHI,1
C,7@
R¨ ¥
@ ©©G,3 HH ¨¢¥
¢ K,4
©
§
4¦ §¦
j 8
H
(7,14) (13,21)

Critical path is A - D - H -J

(b)
¨¥ ¥
¨(11,11)
(4,4)
D,7
§
2¦ §¦ H
- 7 H
µ
¡
H
j
H 6 HG,3
H
A,4
¨¥ j¨ ¥
¡ H
j
H (4,12) HH
¡
§5¦ §¦
- 9
¡ ©
* 6
¡ (2,6) © Á
­ H,2 ¢¢̧(14,14)
­
(0,0) ¨ ¥¡ B,2 - ¨ ¥©©
* ­ ¢ F,8
§
1¦ §
3 ¦XX
z ­ 6 ¢
@ X z
X
­ ¢
­ Xz
X
@ X
z
X ¢
­ z 6
X
z ¨¥
@ X ¢
­ XX
§
8 ¦(6,6)
@
C,3@ ­
R¨ ¥ 6¡
@ ­ ¨¥ µ
- 6 ¡
§¦
4 §¦
(3,3) E,3 (6,6)

There are two critical paths: A - D - G and C - E - F.