Question

A Project has the following time schedule

Activity	1 - 2	2 - 3	2 - 4	3 - 5	4 - 6	5 - 6
Duration (in days)	6	8	4	9	2	7

Draw the network for the project, calculate the earliest start time, earliest finish time, latest start time and latest finish time of each activity and find the critical path. Compute the project duration.

Answer 1

E₁ = 0

E₂ = 0 + 6 = 6

E₃ = 6 + 8 = 14

E₄ = 6 + 4 = 10

E₅ = 14 + 9 = 23

E₆ = (23 + 7) or (10 + 2)

Whichever is maximum

= 30

L₆ = 30

L₅ = 30 − 6 = 24

L₄ = 30 − 2 = 28

L₃ = 23 − 9 = 14

L₂ = (14 − 8) or (28 − 4)

Whichever is minimum

= 6

L₁ = 6 − 6 = 0

Activity	Duration tij	EST	EFT = EST + tij	LST = LFT – tij	LFT
1 - 2	6	0	6	6 − 6 = 0	6
2 - 3	8	6	14	14 − 8 = 6	14
2 - 4	4	6	10	28 − 4 = 24	28
3 - 5	9	14	23	23 − 9 = 14	23
4 - 6	2	10	22	30 − 28 = 2	4
5 - 6	7	23	30	30 − 7 = 23	30

Since EFT and LFT values are same in 1 - 2, 2 - 3, 3 - 5 and 5 - 6.

Hence the critical path is 1 - 2 - 3 - 5 - 6 and the duration of time taken is 30 days.