You are on page 1of 3

MTH 601

ASSIGNMENT NO 1

NAME: SYED MUHAMMAD HAMZA

ID : Bc190410300

Question No 1

Consider the network diagram which consists of the following activities ----------------------

SOLUTION

Firstly, we go forward from the 1st activity and calculate EST of each activity. For Forward we take
maximum value. Then

We go backward from the last activity and calculate LFT of each activity. For Backward we take
minimum value

(10, 16) (13, 25)

E (3)
2 5
B (8) I (2)
D (6)
(0, 0) (2, 2)
A (2) (16, 22) H (5)
0 1 4 7 (27,27)

F (3) J (8)
C (10)
G (7)
3 6
(12, 12) (19, 19)

HERE:

 Earliest Start Time(EST)


 Earliest Finish Time(EFT)
 Latest Start Time(LST)
 Latest Finish Time(LFT)
Activity Duration EST EFT LST LFT
(D) (EST+D) (LFT-D)
0-1 2 0 2 0 2
1-2 8 2 10 8 16
1-3 10 2 12 2 12
2-4 6 10 16 16 22
2-5 3 10 13 22 25
3-4 3 12 15 19 22
3-6 7 12 19 12 19
4-7 5 16 21 22 27
5-7 2 13 15 25 27
6-7 8 19 27 19 27

Question No 2:
The time estimates for the activity of the PERT diagram are given in the table below.
Calculate the expected time, variance and standard deviation for each activity

Activity to tm tp
1-2 1 2 3
2-3 8 10 12
2-4 2 4 6
2-5 3 5 7
3-6 4 5 6
4-6 7 8 9
5-7 6 8 10
6-7 1 4 7

SOLUTION

Activity to tm tp Expected Time Standard Variance


t e = t0 + 4tm + Deviation Vt = ( tp – t0)/6)2
tp /6 St = tp – t0 / 6

1-2 1 2 3 2 1/3 1/9


2-3 8 10 12 10 2/3 4/9
2-4 2 4 6 4 2/3 4/9
2-5 3 5 7 5 2/3 4/9
3-6 4 5 6 5 1/3 1/9
4-6 7 8 9 8 1/3 1/9
5-7 6 8 10 8 2/3 4/9
6-7 1 4 7 4 1 1

You might also like