Scheduling problem
Scheduling problem
5
2
3 8
1
4 6
5
2
K6 [15,21]
G4 [7,11] 8
3 7
1 [12,16] [16,22]
4 6
A2 [0,2]
[9,11] D3 (2,5]
(11,14)
B7
(0,7]
[0,71 E6
(7,13]
(8,14)
IsT'ET]I9T'
Z1tt]
[C&
0,8] K6[15,21]
(3,1 ] G4 (7,11] [16,22]
[12,16]
F10 [7,17) J 5
[ 1 7 , 2 2 ]
(17,22)
[7,17]
H6 [8,14]
[11,17]
Problem Statement - Draw the network and calculate the earliest start (ES), earliest finish (EF), Latest start (LS),
latest finish (LF) times of each of the activities.