lOMoARcPSD|29720993

Problem 2

Develop a network diagram for the project specified below:

Immediate
Activity Predecessor
Activity
A -

B A

C, D B

E C

F D

G E, F

Solution

Activity A has no predecessor activity. i.e., It is the first activity. Let

us suppose that activity A takes the project from event 1 to event 2. Then
we have the following representation for A:

A
1 2

For activity B, the predecessor activity is A. Let us suppose that B

joins nodes 2 and 3. Thus we get

A B
1 2 3

Activities C and D have B as the predecessor activity. Therefore we

obtain the following:

247
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

4
C
B
2 3

Activity E has D as the predecessor activity. So we get

C E
3 4 6

Activity F has D as the predecessor activity. So we get

D F
3 5 6l
”

Activity G has E and F as predecessor activities. This is possible

only if nodes 6 and 6l are one and the same. So, rename node 6l as node 6.
Then we get

D F
3 5 6!

and

4
E

6
G 7
F
5

248
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

G is the last activity.

Putting all the pieces together, we obtain the following diagram the
project network:

C 4
Start event E End event
A B
1 2 3 G
6 7

D 5 F

The diagram is validated by referring to the given data.

Note: An important point may be observed for the above diagram.

Consider the following parts in the diagram

C E
3 4 6

and

D F
3 5 6l
”

We took nodes 6 and 6l as one and the same. Instead, we can retain
them as different nodes. Then, in order to provide connectivity to the
network, we join nodes 6l and 6 by a dummy activity. Then we arrive at
the following diagram for the project network:

E
Start event C 4
6
G
1 2 3 dummy
A B
activity
7
D
F
5 6l
!
End event

249
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Path In A Project

A continuous sequence, consisting of nodes and activities

alternatively, beginning with the start event and stopping at the end event
of a network is called a path in the network.

Critical Path And Crtical Activities

Consider all the paths in a project, beginning with the start

event and stopping at the end event. For each path, calculate the time of
execution, by adding the time for the individual activities in that path.

The path with the largest time is called the critical path and the
activities along this path are called the critical activities or bottleneck
activities. The activities are called critical because they cannot be delayed.
However, a non-critical activity may be delayed to a certain extent. Any
delay in a critical activity will delay the completion of the whole project.
However, a certain permissible delay in a non –critical activity will not
delay the completion of the whole project. It shall be noted that delay in a
non-critical activity beyond a limit would certainly delay the completion
the whole project. Sometimes, there may be several critical paths for a
project. A project manager shall pay special attention to critical activities.

Problem 1

The following details are available regarding a project:

Predecessor
Activity Duration (Weeks)
Activity
A - 3

B A 5

C A 7

D B 10

E C 5

F D,E 4

252
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Determine the critical path, the critical activities and the project
completion time.

Solution

First let us construct the network diagram for the given project. We
mark the time estimates along the arrows representing the activities. We
obtain the following diagram:

Start event B 3 D End event

5 10
A
1 2
3 F
5 6
C 4
7 E
5
4

Consider the paths, beginning with the start node and stopping
with the end node. There are two such paths for the given project. They are
as follows:

Path I

A B D F
1 2 3 5 6
3 5 10 4

with a time of 3 + 5 + 10 + 4 = 22 weeks.

Path II

A C E F
1 2 4 5 6
3 7 5 4

with a time of 3 + 7 + 5 + 4 = 19 weeks.

Compare the times for the two paths. Maximum of {22,19} = 22.
We see that path I has the maximum time of 22 weeks. Therefore, path
I is the critical path. The critical activities are A, B, D and F. The project

253
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

completion time is 22 weeks.

We notice that C and E are non- critical activities.
Time for path I - Time for path II = 22- 19 = 3 weeks.

Therefore, together the non- critical activities can be delayed upto

a maximum of 3 weeks, without delaying the completion of the whole
project.

Problem 2

Find out the completion time and the critical activities for the
following project:
D
5
2 20 1

G 8
A
8 E H 11 K 6
B 6 8 10
1 3
10 16
14
1 1

I L
7 5
C
J 9
F 10 1

7
4 25

Solution

In all, we identify 4 paths, beginning with the start node of 1 and

terminating at the end node of 10. They are as follows:

Path I

A D G K
1 2 5 8 10
8 20 8 6

Time for the path = 8 + 20 + 8 + 6 = 42 units of time.

254
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Path II

B E H K
1 3 6 8 10
10 16 11 6

Time for the path = 10 + 16 + 11 + 6 = 43 units of time.

Path III

B E I L
1 3 6 9 10
10 16 14 5

Time for the path = 10 + 16 + 14 + 5 = 45 units of time.

Path IV

C F J L
1 4 7 9 10
7 25 10 5

Time for the path = 7 + 25 + 10 + 5 = 47 units of time.

Compare the times for the four paths. Maximum of {42,

43, 45, 47} = 47. We see that the following path has the maximum
time and so it is the critical path:

C F J L
1 4 7 9 10
7 25 10 5

The critical activities are C, F, J and L. The non-critical activities

are A, B, D, E, G, H, I and K. The project completion time is 47
units of time.
Problem 3

255
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Draw the network diagram and determine the critical path for the
following project:

Activity Time estimate (Weeks)

1- 2 5
1- 3 6

1- 4 3

2 -5 5
3 -6 7

3 -7 10

4 -7 4

5 -8 2

6 -8 5
7 -9 6
8 -9 4

Solution

We have the following network diagram for the project:

D 5
2
5 1
H
2
A
5
1 B E 6
I 8
K
3
6 7 1
3 1
4 9
1

10 J
3 C F
6
G 7
4
4

256
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Solution

We assert that there are 4 paths, beginning with the start node of 1
and terminating at the end node of 9. They are as follows:

Path I

A D H K 9
1 2 5 8
5 5 2 4

Time for the path = 5 + 5 + 2 + 4 = 16 weeks.

Path II

B E I K 9
1 3 6 8
6 7 5 4

Time for the path = 6 + 7 + 5 + 4 = 22 weeks.

Path III

B F J
1 3 7 9
6 10 6

Time for the path = 6 + 10 + 6 = 16 weeks.

Path IV

C 4 5
1 4 7 9
3 4 6

Time for the path = 3 + 4 + 6 = 13 weeks.

Compare the times for the four paths. Maximum of {16, 22, 16, 13}
= 22. We see that the following path has the maximum time and so it is the
critical path:

257
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

D E I K
1 3 6 8 9
6 7 5 4

The critical activities are B, E, I and K. The non-critical activities are A, C,

D, F, G, H and J. The project completion time is 22 weeks.

Questions

1. Explain the terms: critical path, critical activities.

2. The following are the time estimates and the precedence relationships
of the activities in a project network:

IMMEDIATE
time estimate
Activity Predecessor
(weeks)
Activity
A - 4

B - 7

C - 3

D A 6

E B 4

F B 7

G C 6

H E 10

I D 3

J F, G 4

K H, I 2

Draw the project network diagram. Determine the critical path and the
project completion time.

****

258
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Measure Of Certainty

The 3 estimates of time are such that

to ≤ t m ≤ t p

Therefore the range for the time estimate is t p − to .

The time taken by an activity in a project network follows

a distribution with a standard deviation of one sixth of the range,
approximately.

t p − to
i.e., The standard deviation = σ =
6
2
 t p − to 
and the variance = σ = 
2

 6 
The certainty of the time estimate of an activity can be analysed with
the help of the variance. The greater the variance, the more uncertainty in
the time estimate of an activity.

Problem 1

Two experts A and B examined an activity and arrived at the

following time estimates.

Time Estimate
Expert
to tm tp

A 4 6 8

B 4 7 10

Determine which expert is more certain about his estimates of

time:

Solution
2
 t −t 
Variance ( σ ) in time estimates =  p o 
2

 6 

261
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

2
8−4 4
In the case of expert A, the variance =   =
 6  9
2
 10 − 4 
As regards expert B, the variance =   =1
 6 

So, the variance is less in the case of A. Hence, it is concluded that

the expert A is more certain about his estimates of time.

Determination of Project Completion Time in PERT

Problem 2

Find out the time required to complete the following project and
the critical activities:
Optimistic Most likely Pessimistic
Predecessor
Activity time estimate time estimate time estimate
Activity
(to days) (tm days) (tp days)

A - 2 4 6

B A 3 6 9

C A 8 10 12

D B 9 12 15

E C 8 9 10

F D, E 16 21 26

G D, E 19 22 25

H F 2 5 8

I G 1 3 5

Solution

From the three time estimates t p , tm and to , calculate te for each

activity. We obtain the following table:

262
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Optimistic 4 x Most Pessimistic Time estimate

to+ 4tm
Activity time likely time time
+ tp to + 4 t m + t p
estimate (to) estimate estimate (tp) te =
6

A 2 16 6 24 4

B 3 24 9 36 6

C 8 40 12 60 10

D 9 48 15 72 12

E 8 36 10 54 9

F 16 84 26 126 21

G 19 88 25 132 22

H 2 20 8 30 5

I 1 12 5 18 3

Using the single time estimates of the activities, we get the

following network diagram for the project.

3 F 6
B
12 21
A 6 5
1 2 5 I
4 8
10 E
22 3
9
4 7

Consider the paths, beginning with the start node and stopping
with the end node. There are four such paths for the given project. They
are as follows:

263
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Path I

A B D F H
1 2 3 5 6 8
4 6 12 21 5

Time for the path: 4+6+12+21+5 = 48 days.

Path II

A B D G I
1 2 3 5 7 8
4 6 12 6 6 3

Time for the path: 4+6+12+ 6+3 = 31 days.

Path III
A C E F H
1 2 4 5 6 8
4 10 3 9 21 5
7

Time for the path: 4+10+9+ 21+5 = 49 days.

Path IV
A C E G I
1 2 4 5 7 8
4 10 9 6 6 3

Time for the path: 4+10+9+ 6+3 = 32 days.

Compare the times for the four paths.
Maximum of {48, 31, 49, 32} = 49.
We see that Path III has the maximum time.
Therefore the critical path is Path III. i.e., 1 2 4 5 6 8.
The critical activities are A, C, E, F and H.
The non-critical activities are B, D, G and I.
Project time (Also called project length) = 49 days.

Problem 3

Find out the time, variance and standard deviation of the project
with the following time estimates in weeks:

264
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Optimistic Most likely Pessimistic

Activity time estimate time estimate time estimate
(to) (tm) (tp)

1-2 3 6 9

1-6 2 5 8

2-3 6 12 18

2-4 4 5 6

3-5 8 11 14

4-5 3 7 11

6-7 3 9 15

5-8 2 4 6

7-8 8 16 18

Solution

From the three time estimates t p , tm and to , calculate te for each

activity. We obtain the following table:

Optimistic
4 x Most Pessimistic
time to+ 4tm Time estimate
Activity likely time time estimate t + 4 tm + t p
stimate + tp te = o
estimate (tp) 6
(to)

1-2 3 24 9 36 6

1-6 2 20 8 30 5

2-3 6 48 18 72 12

2-4 4 20 6 30 5

3-5 8 44 14 66 11

265
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

4-5 3 28 11 42 7

6-7 3 36 15 54 9

5-8 2 16 6 24 4

7-8 8 64 18 90 15

With the single time estimates of the activities, we get the following
network diagram for the project.

C 3 F
11
12
2 5
A G
6 5 7 4
4
1
8
B H
5
E 15
6
7
9
Consider the paths, beginning with the start node and stopping with the
end node. There are three such paths for the given project. They are as
follows:

Path I

A C F I
1 2 3 5 8
6 12 11 4

Time for the path: 6+12+11+4 = 33 weeks.

Path II

A D G I
1 2 4 5 8
6 5 3 7 4

Time for the path: 6+5+7+ 4= 22 weeks.

Path III

266
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

B E H
1 6 7 8
5 9 3 15

Time for the path: 5+9+15 = 29 weeks.

Compare the times for the three paths.
Maximum of {33, 22, 29} = 33.
It is noticed that Path I has the maximum time.
Therefore the critical path is Path I. i.e., 1 2 3 5 8
The critical activities are A, C, F and I.
The non-critical activities are B, D, G and H.
Project time = 33 weeks.

Calculation of Standard Deviation and Variance for the Critical

Activities:

Pessimistic
Optimistic Most likely Standard
Critical time Range Variance 2
time estimate timeestimate deviation =  t −t 
Activity estimate (tp - to) t p − to σ =  p o 
2

(to) (tm) σ=  6 
(tp) 6

A: 1 2 3 6 9 6 1 1

C: 2 3 6 12 18 12 2 4

F: 3 5 8 11 14 6 1 1

I: 5 8 2 4 6 4 2/3 4/9

Variance of project time (Also called Variance of project length) =

Sum of the variances for the critical activities = 1+4+1+ 4/9 = 58/9 Weeks.
Standard deviation of project time = √Variance = √58/9 = 2.54 weeks.

Problem 4

A project consists of seven activities with the following time

estimates. Find the probability that the project will be completed in 30
weeks or less.

267
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Optimistic Most likely Pessimistic

Predecessor
Activity time estimate time estimate time estimate
Activity
(to days) (tm days) (tp days)
A - 2 5 8
B A 2 3 4
C A 6 8 10
D A 2 4 6
E B 2 6 10
F C 6 7 8
G D, E, F 6 8 10
Solution

From the three time estimates , and , calculate for each activity.
The results are furnished in the following table:

Optimistic Pessimistic
4 x Most
time time to+ 4tm Time estimate
Activity likely time t + 4 tm + t p
estimate estimate + tp te = o
estimate 6
(to) (tp)

A 2 20 8 30 5
B 2 12 4 18 3
C 6 32 10 48 8
D 2 16 6 24 4
E 2 24 10 36 6
F 6 28 8 42 7
G 6 32 10 48 8

With the single time estimates of the activities, the following

network diagram is constructed for the project.

3
B
3 6
4
E
C 7
A 8 F G
1 2 D 6
5
5 4 8

268
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Consider the paths, beginning with the start node and stopping
with the end node. There are three such paths for the given project. They
are as follows:

Path I

A B E G
1 2 3 5 6
5 3 4
6 8 8

Time for the path: 5+3+6+8 = 22 weeks.

Path II

A C F G
1 2 4 5 6
5 8 4 7 8 8

Time for the path: 5+8+7+ 8 = 28 weeks.

Path III

A D G
1 2 5 6
5 4 4 8

Time for the path: 5+4+8 = 17 weeks.

Compare the times for the three paths.

Maximum of {22, 28, 17} = 28.
It is noticed that Path II has the maximum time.
Therefore the critical path is Path II. i.e., 1 2 4 5 6.
The critical activities are A, C, F and G.
The non-critical activities are B, D and E.
Project time = 28 weeks.

Calculation of Standard Deviation and Variance for the

Critical Activities:

269
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Optimistic Most likely Pessimistic Standard

Variance
Critical time time time Range deviation =
2
Activity estimate estimate estimate (tp -to)  t p − to 
t p − to σ2 = 
(to) (tm) (tp) σ=  6 
6

A: 1 2 2 5 8 6 1 1

2 4
C: 2 4 6 8 10 4
3 9

F: 4 5 6 7 8 2 1 1
3 9

2 4
G: 5 6 6 8 10 4
3 9

Standard deviation of the critical path = √2 = 1.414

The standard normal variate is given by the formula

Given value of t − Expected value of t in the critical path

Z=
SD for the critical path

30 − 28
So we get Z = = 1.414
1.414

We refer to the Normal Probability Distribution Table.

Corresponding to Z = 1.414, we obtain the value of 0.4207
We get 0.5 + 0.4207 = 0. 9207

Therefore the required probability is 0.92

i.e., There is 92% chance that the project will be completed before 30 weeks.
In other words, the chance that it will be delayed beyond 30 weeks is 8%

270
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

gives the Latest Allowable Time of Occurrence of the event.

Slack Of An Event

The allowable time gap for the occurrence of an event is known as

the slack of that event. It is given by the formula

Slack of an event = Latest Allowable Time of Occurrence of the event -

Earliest Expected Time of Occurrence of that event.

Slack Of An Activity

The slack of an activity is the float of the activity.

Problem 1

The following details are available regarding a project:

Predecessor
Activity Duration (Weeks)
Activity
A - 12
B A 7
C A 11
D A 8
E A 6
F B 10
G C 9
H D, F 14
I E, G 13
J H, I 16

Determine the earliest and latest times, the total float for each
activity, the critical activities and the project completion time.

279
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Solution

With the given data, we construct the following network diagram

for the project.

3
F
B 10
7 5 H
D
8 14
A
1 2 7 8
12
E I
6 16
11
6
C G
9
4

Consider the paths, beginning with the start node and stopping
with the end node. There are four such paths for the given project. They
are as follows:

Path I

A B F H J
1 2 3 5 7 1
12 7 10 14 16

Time of the path = 12 + 7 + 10 + 14 + 16 = 59 weeks.

Path II

A D H J
1 2 5 14 7 16 8
12 8

Time of the path = 12 + 8 + 14 + 16 = 50 weeks.

Path III
A E I J
1 2 6 7 8
12 6 13 16

280
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Time of the path = 12 + 6 + 13 + 16 = 47 weeks.

Path IV

A C G I J
1 2 4 6 7 8
12 11 9 13 16

Time of the path = 12 + 11 + 9 + 13 + 16 = 61 weeks.

Compare the times for the four paths. Maximum of {51, 50, 47, 61} = 61.
We see that the maximum time of a path is 61 weeks.

Forward pass

Calculation of Earliest Expected Time of Occurrence of Events

Node Earliest Time of Occurrence of Node

1 0

2 Time for Node 1 + Time for Activity A = 0 + 12 = 12

3 Time for Node 2 + Time for Activity B = 12 + 7 = 19

4 Time for Node 2 + Time for Activity C = 12 + 11 = 23

Max {Time for Node 2 + Time for Activity D,

5
Time for Node 3 + Time for Activity F}
= Max {12 + 8, 19 + 10} = Max {20, 29} = 29

Max {Time for Node 2 + Time for Activity E,

6
Time for Node 4 + Time for Activity G}
= Max {12 + 6, 23 + 9} = Max {18, 32} = 32

Max {Time for Node 5 + Time for Activity H,

7
Time for Node 6 + Time for Activity I}
= Max {29 + 14, 32 + 13} = Max {43, 45} = 45

8 Time for Node 7 + Time for Activity J = 45 + 16 = 61

281
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Using the above values, we obtain the Earliest Start Times of the
activities as follows:

Earliest Start Time

Activity
(Weeks)
A 0

B 12

C 12

D 12

E 12

F 19

G 23

H 29

I 32

J 45

Backward pass

Calculation of Latest Allowable Time of Occurrence of Events

Node Latest Allowable Time of Occurrence of Node

8 Maximum time of a path in the network = 61

7 Time for Node 8 - Time for Activity J = 61 -16 = 45

6 Time for Node 7 - Time for Activity I = 45 -13 = 32

5 Time for Node 7 - Time for Activity H = 45 -14 = 31

4 Time for Node 6 - Time for Activity G = 32 - 9 = 23

3 Time for Node 5 - Time for Activity F = 31- 10 = 21

282
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Min {Time for Node 3 - Time for Activity B,

Time for Node 4 - Time for Activity C,
Time for Node 5 - Time for Activity D,
2
Time for Node 6 - Time for Activity E}
= Min {21 - 7, 23 - 11, 31 - 8, 32 - 6}
= Min {14, 12, 23, 26} = 12

1 Time for Node 2 - Time for Activity A = 12- 12 = 0

Using the above values, we obtain the Latest Finish Times of the
activities as follows:

Latest Finish Time

Activity
(Weeks)

J 61

I 45

H 45

G 32

F 31

E 32

D 31

C 23

B 21

A 12

283
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Calculation of Total Float for each activity:

Latest
Earliest Earliest Latest Total Float = Latest
Duration
Activity Start Finish Start Finish Time - Earliest
(Weeks) Finish
Time Time Time Finish Time
Time
A 12 0 12 0 12 0

B 7 12 19 14 21 2

C 11 12 23 12 23 0

D 8 12 20 23 31 11

E 6 12 18 26 32 14

F 10 19 29 21 31 2

G 9 23 32 23 32 0

H 14 29 43 31 45 2

I 13 32 45 32 45 0

J 16 45 61 45 61 0

The activities with total float = 0 are A, C, G, I and J. They are the
critical activities.
Project completion time = 61 weeks.

Problem 2

The following are the details of the activities in a project:

Predecessor Duration
Activity
Activity (Weeks)

A - 15

B A 17

C A 21

284
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

D B 19

E B 22

F C, D 18

G E, F 15

Calculate the earliest and latest times, the total float for each
activity and the project completion time.

Solution

The following network diagram is obtained for the given project.

3
B G
15
A 17 D 19
1 2 5 6
15
21 F
C 18
4

Consider the paths, beginning with the start node and stopping
with the end node. There are three such paths for the given project. They
are as follows:

Path I

A B E G
1 2 3 5 6
15 17 22 15

Time of the path = 15 + 17 + 22 + 15 = 69 weeks.

Path II

A B D F G
1 2 3 4 5 6
15 17 19 18 15

285
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Time of the path = 15 + 17 + 19 + 18 + 15 = 84 weeks.

Path III

A C F G
1 2 4 5 6
15 21 18 15

Time of the path = 15 + 21 + 18 + 15 = 69 weeks.

Compare the times for the three paths. Maximum of {69, 84, 69} = 84. We
see that the maximum time of a path is 84 weeks.

Forward pass

Calculation of Earliest Time of Occurrence of Events

Node Earliest Time of Occurrence of Node

1 0

2 Time for Node 1 + Time for Activity A = 0 + 15 = 15

3 Time for Node 2 + Time for Activity B = 15 + 17 = 32

Max {Time for Node 2 + Time for Activity C,

4 Time for Node 3 + Time for Activity D}
= Max {15 + 21, 32 + 19} = Max {36, 51} = 51

Max {Time for Node 3 + Time for Activity E,

5 Time for Node 4 + Time for Activity F}
= Max {32 + 22, 51 + 18} = Max {54, 69} = 69

6 Time for Node 5 + Time for Activity G = 69 + 15 = 84

286
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Calculation of Earliest Time for Activities

Earliest Start Time

Activity
(Weeks)

A 0

B 15

C 15

D 32

E 32

F 51

G 69

Backward pass

Calculation of the Latest Allowable Time of Occurrence of Events

Node Latest Allowable Time of Occurrence of Node

6 Maximum time of a path in the network = 84

5 Time for Node 6 - Time for Activity G = 84 -15 = 69

4 Time for Node 5 - Time for Activity F = 69 - 18 = 51

Min {Time for Node 4 - Time for Activity D,

3 Time for Node 5 - Time for Activity E}
= Min {51 - 19, 69 - 22} = Min {32, 47} = 32

Min {Time for Node 3 - Time for Activity B,

2 Time for Node 4 - Time for Activity C}
= Min {32 - 17, 51 - 21} = Min {15, 30} = 15

1 Time for Node 2 - Time for Activity A = 15 - 15 = 0

287
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Calculation of the Latest Finish Times of the activities

Latest Finish Time

Activity
(Weeks)
G 84

F 69

E 69

D 51
C 51

B 32

A 15

Calculation of Total Float for each activity:

Earliest Earliest Latest Latest Total Float = Latest

Duration
Activity Start Finish Start Finish Finish Time - Earliest
(Weeks)
Time Time Time Time Finish Time

A 15 0 15 0 15 0

B 17 15 32 15 32 0

C 21 15 36 30 51 15

D 19 32 51 32 51 0

E 22 32 54 47 69 15

F 18 51 69 51 69 0

G 15 69 84 69 84 0

288
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

The activities with total float = 0 are A, B, D, F and G. They are the
critical activities.
Project completion time = 84 weeks.

Problem 3

Consider a project with the following details:

Name of Predecessor Duration

Activity Activity (Weeks)

A - 8

B A 13

C A 9

D A 12

E B 14

F B 8

G D 7

H C, F, G 12

I C, F, G 9

J E, H 10

K I, J 7

Determine the earliest and latest times, the total float for each
activity, the critical activities, the slacks of the events and the project
completion time.

289
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Solution

The following network diagram is got for the given project:

E
3 6
14
B 8 H 10
13 F 12 J

A C I K 8
1 2 5 7
8 9 9 7
12 G
D 7
4

Path I

A B E J K
1 2 3 6 7 8
8 13 14 10 7

Time of the path = 8 + 13 + 14 + 10 + 7 = 52 weeks.

Path II

A B F H J K
1 2 3 5 6 7 8
8 13 8 12 10 7

Time of the path = 8 + 13 + 8 + 12 + 10 + 7 = 58 weeks.

Path III

A B F I K
1 2 3 5 7 8
8 3 8 9 7

Time of the path = 8 + 13 + 8 + 9 + 7 = 45 weeks.

290
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Path IV

A C H J K
1 2 5 6 7 8
8 9 12 5 10 7

Time of the path = 8 + 9 + 12 + 10 + 7 = 46 weeks.

Path V

A C I K
1 2 5 7 8
8 9 5 9 7 6

Time of the path = 8 + 9 + 9 + 7 = 33 weeks.

Path VI

A D G H J K
1 2 4 5 6 7 7 8
8 12 7 12 10

Time of the path = 8 + 12 + 7 + 12 + 10 + 7 = 56 weeks.

Path VII

A D G I K
1 2 4 5 7 8
8 12 7 9 7

Time of the path = 8 + 12 + 7 + 9 + 7 = 43 weeks.

Compare the times for the three paths. Maximum of {52, 58, 45, 46, 33, 56,
43} = 58.
We see that the maximum time of a path is 58 weeks.

291
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Forward pass

Calculation of Earliest Time of Occurrence of Events

Node Earliest Time of Occurrence of Node

1 0

2 Time for Node 1 + Time for Activity A = 0 + 8 = 8

3 Time for Node 2 + Time for Activity B = 8 + 13 = 21

4 Time for Node 2 + Time for Activity D = 8+ 12 = 20

Max {Time for Node 2 + Time for Activity C,

Time for Node 3 + Time for Activity F,
5
Time for Node 4 + Time for Activity G}
= Max { 8 + 9, 21 + 8 , 20 + 7 } = Max {17, 29, 27} = 29

Max {Time for Node 3 + Time for Activity E,

6 Time for Node 5 + Time for Activity H}
= Max {21 + 14 , 29 + 12} = Max {35, 41} = 41

Max {Time for Node 5 + Time for Activity I,

7 Time for Node 6 + Time for Activity J}
= Max {29 + 9, 41 + 10} = Max {38, 51} = 51

8 Time for Node 7 + Time for Activity J = 51+ 7 = 58

Earliest Start Times of the activities

Earliest Start Time

Activity
(Weeks)

A 0

B 8

292
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

C 8

D 8

E 21

F 21

G 20

H 29

I 29

J 41

K 51

Backward pass

Calculation of Latest Allowable Time of Occurrence of Events

Node Latest Allowable Time of Occurrence of Node

8 Maximum time of a path in the network = 58

7 Time for Node 8 - Time for Activity K = 58 -7 = 51

6 Time for Node 7 - Time for Activity J = 51 -10 = 41

Min {Time for Node 6 - Time for Activity H,

5 Time for Node 7 - Time for Activity I}
= Min {41 - 12, 51 - 9} = Min {29, 42} = 29

4 Time for Node 5 - Time for Activity G = 29 - 7 = 22

Min {Time for Node 5 - Time for Activity F,

3 Time for Node 6 - Time for Activity E}
= Min {29 - 8, 41 - 14} = Min {21, 27} = 21

293
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Min {Time for Node 3 - Time for Activity B, Time for Node 4 -
Time for Activity D,
2
= Min {21 - 13, 22 - 12, 29 - 9}
= Min {8, 10, 20} = 8

1 Time for Node 2 - Time for Activity A = 8 - 8 = 0

Latest Finish Times of the activities

Latest Finish Time

Activity
(Weeks)

K 58

J 51

I 51

41
H

G 29

29
F

E 41

22
D

C 29

21
B

A 8

Calculation of Total Float for each activity:

294
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Earliest Earliest Latest Latest Total Float = Latest

Duration
Activity Start Finish Start Finish Finish Time - Earliest
(Weeks)
Time Time Time Time Finish Time

A 8 0 8 0 8 0

B 13 8 21 8 21 0

C 9 8 17 20 29 12

D 12 8 20 10 22 2

E 14 21 35 27 41 6

F 8 21 29 21 29 0

G 7 20 27 22 29 2

H 12 29 41 29 41 0

I 9 29 38 42 51 13

J 10 41 51 41 51 0

K 7 51 58 51 58 0

The activities with total float = 0 are A, B, F, H, J and K. They are the
critical activities.
Project completion time = 58 weeks.

Calculation of slacks of the events

Slack of an event = Latest Allowable Time of Occurrence of the

event - Earliest Expected Time of Occurrence of that event.

295
Downloaded by Sajal Jindal ([email protected])
 lOMoARcPSD|29720993

Latest
Allowable
Event Earliest Expected Time Slack of
Time of
(Node) of Occurrence of Event the Event
Occurrence of
Event

1 0 0 0

2 8 8 0

3 21 21 0

4 20 22 2

5 29 29 0

6 41 41 0

7 51 51 0

8 58 58 0

Interpretation

On the basis of the slacks of the events, it is concluded that the

occurrence of event 4 may be delayed upto a maximum period of 2 weeks
while no other event cannot be delayed.

Questions

1. Explain the terms: The earliest and latest times of the activities of a
project.
2. Explain the procedure to find the earliest expected time of an event.
3. Explain the procedure to find the latest allowable time of an event.
4. What is meant by the slack of an activity? How will you determine it?
5. Consider the project with the following details:

296
Downloaded by Sajal Jindal ([email protected])