NETWORK

PROBLEM
By: Mohit Singhal{0181BBA090}
ACTIVITY IMMEDIATE DURATION
PRODECESSOR
A ---- 6
B A 12
C A 7
D C 9
E B,D 7
F E 6
G B,D 5
H F,G 11
 5

E 29 29
F
7 6
4 G 6
22 22 5 35 35
B
12 H
1 2
A 11
0 0 D
6 6 6 9
C 7
7 46 46
3
13 13
■ Critical Path  A – C – D – E – F – H
OR
1–2–3–4–5–6–7

■ Total Duration  6+7+9+7+6+11

= 46
ACTIVIT DURATION ES EF LS LF TF HS FF TS IF
Y
A (1 - 2) 6 0 6 0 6 0 0 0 0 0
B (2 - 3) 12 6 18 10 22 4 0 4 0 4
C (2 - 4) 7 6 13 6 13 0 0 0 0 0
D (3 - 4) 9 13 22 13 22 0 0 0 0 0
E (4 - 5) 7 22 29 22 29 0 0 0 0 0
F (5 - 6) 6 29 35 29 35 0 0 0 0 0
G (4 - 6) 5 22 27 30 35 8 0 8 0 0
H (6 - 7) 11 35 46 35 46 0 0 0 0 0

ES – Earliest start
EF – Earliest Finish 1. EF = Duration + ES
LS – Latest Start 2. LS = LF -- Duration
LF – Latest Finish 3. TF = LS – ES
TF – Total Float 4. FF = TF – HS
HS – Head slack 5. IF = FF – TS
FF – Free Float
IF – Independent Float