Problems on C.P.

M &PERT
Problem1:

An assemble is to be made from 2 parts x a d y. Botha parts must be turned a lathe. y must be
polished whereas x need not be polished. The sequence of actives, to gather with their predecessor
s given below.
Activity Description Predecessor activity
A Open work order -
B Get Material for X A
C Get material for Y A
D Then X on lathe B
E Then y on lathe B,C
F Polish Y E
G Assemble x and y D,F
H Pack G
Draw a net work diagram of activities for project.

Solution:

4 D
B

A G H
1 2 1 Dummy 6 7 8

C F
3 5
E

Problem-2:
Listed in the table are the activities and sequencing necessary for a maintenance job on the heat
exchanging.

1
Activity Description Predecessor
A Dismantle pipe connections -
B Dismantle heater, closure, A
and floating front
C Remove Tube Bundle B
D Clean bolts B
E Clean heater and floating B
head front
F Clean tube bundle C
G Clean shell C
H Replace tube bundle F,G
I Prepare shell pressure test D,E,H
J Prepare tube pressure test I
And reassemble

Draw a net work diagram of a activities for the projects.

Solution:
5 2
F

C 4 6 H
A J
B D
1 2 3 8 9 10
I

E 1

Problem-3: Listed in the table are activities and sequencing necessary for the completion of a
recruitment procedure for management trainees (t) in a firm.

2
Solution:
Activity Description Predecessor Activity
A Asking units for recruitments -
B Ascertaining management A
trains(MTs) requirement for
commercial function
C Asserting MTs requirement A
for Account/finance
functions
D Formulating advertisement C
for MT(commercial)
E Calling applications from the B
succedfull conditions passing
through the institute
F Calling application s from the C
successful conditions passing
through the institute of
chartered Accounts (ICA)
G Releasing the advertisement D,E
H Completing applications G
received
I Screening of applications H
against advertisement
J Screening of applications F
received from ICA
K Sending of personal forms I,J
L Issuing interview/regret K
letters
M Preliminary interviews L
N Preliminary interviews of J
outstanding candidates from
ICA
O Final inter view M,N

Draw a network of activities for the project.

Solution: the net work diagram for the given project.

3
 I L O
E H
3 5 7 9 1 1 1 1 1
G 0 1 2 3 4
B K M

A D R
1 2

C
4 6 8 N
F J

PROBLEMS ON CRITICAL PATH METHOD (CPM):

PROBLEM-1:
A project has the following times schedule
Activity 1-2 1-3 2-4 3-4 3-5 4-9 5-6 5-7 6-8 7-8 8-9 8-10 9-10
Time in 4 1 1 1 6 5 4 8 1 2 1 8 7
weeks

Construct CPM Network and compute.

I. TE and TL for each event.

II. Float for each activity
III. Critical path and its duration.

SOLUTION:

The net work is constructed as given in diagram.

2 =4
2 =12

2 1 4 =5 9 =18
4 4 =13 9 =18
5
4 7 10 =25
1 = 0, 9
6 =11 10 =25
1 1 = 0
6 =16 6
4 1
1 1 1
0
1 3
5
8
3 =1 7 =15
6 5 =7 2 8
3 =1 7 =15
5 =7
4 8 8 =17
7 8 =17
 FORWARD PASS CALUCLATION: BACKWARD PASS CALUCLATION:
1 = 0 1 =0 10 = 10 = 0
10 = 0
2 = 1 + 12 = 0 + 4 = 4 2 = 4 9 = 10 910 = 25 7 = 18 9 = 18

3 = 1 + 13 = 0 + 1 = 1 8 = { 8 } = {(9 89 )
3 =1
(10 810 )} , J=9, 10
4 = { + 4 } = {(2 + 24 ) = {(18 1), (25 8)} =MIN {17, 17} =17 8 = 17
(3 + 34 )} , i=2, 3 4 = 5
= {(4 + 1), (1 + 1)} =Max {5, 2} =5 7 = 8 87 = 17 2 = 15 7 = 15
5 = 3 + 35 = 1 + 6 = 7 5 = 7
6 = 8 86 = 17 1 = 16 6 = 16
6 = 5 + 56 = 7 + 4 = 11 6 =11 5 = { 5 } = {(6 56 )
(27 57 )} , J=6, 9
7 = 5 + 57 = 7 + 8 = 15 7 =15 = {(15 8), (16 4)} =Min {7, 12} =12 5 = 12
8 = { + 8 } = {(6 + 68 ) 4 = 9 49 = 18 5 = 13
(7 + 78 )} , i=6, 7 4 = 13
= {(11 + 1), (15 + 2)} =Max {12, 17} =17 3 = 5 35 = 7 6 = 11 3 = 11
8 =17
9 = { + 9 } = {(4 + 49 ) 2 = 4 24 = 13 1 = 12
(8 + 89 )} , i=4, 8 2 = 12
= {(5 + 5), (17 + 1)} =Max {10,18} =18 1 = { 1 } = {(2 12 )
9 =18
(3 13 )} , J=2, 3
10 = { + 10 } = {(9 + 910 )
= {(12 4), (1 1)} =Min {0,0} =0
(8 + 810 )} , i=9, 8 1 =
= {(8 + 7), (17 + 8)} =Max {15, 25} =25

10 =25

I. The tail event ( )and head event ( ) computed on the network as follows

EVENT 1 2 3 4 5 6 7 8 9 10
0 4 1 5 7 11 15 17 18 25
0 12 1 13 7 16 15 17 18 25

CRITICAL PATH:

5
Activity Duration Earliest time Latest time Total float
(i.j) of time Starting Finishing time Starting Finishing time
( ) ( ) ( = + ) ( ) T-F=( )
(1) (2) (3) (4)=(3)+(2) =
(5)=(6)-(2) (6) (7)=(5)-(3)
1-2 4 0 4 8 8
12
1-3 1 0 1 10 11 10
2-4 1 4 5 12 13 8
3-4 1 1 2 12 13 12
3-5 6 1 7 6 12 5
4-9 5 5 10 13 18 8
5-6 4 7 11 12 16 5
5-7 8 7 15 7 15 0
6-8 1 11 12 16 17 5
7-8 2 15 17 15 17 0
8-9 1 17 18 17 18 0
8-10 8 17 25 8 0 9
9-10 7 18 25 8 0 10

CRITICAL PATH ACTIVITIES:

From the above table we observe that the activities 5-7, 7-8 and 8-9 are critical
activities as their total float is zero. Hence we have the following critical path.

5-7, 7-8 and 8-9 8+8+7=25

Problem-2: The following table gives activities of duration of construction project work.

ACTIVITY 1-2 1-3 2-3 2-4 3-4 4-3

DURATION 20 25 10 12 6 10

a) Draw the network for the project.

b) Find the critical path.

6
Solution:
2 =20
2 =20

2 12
4 =36
4 =36
20

4 5 =46
10 5 5 =46
1 25 10

1 = 0, 6
1 = 0
3

3 =30
3 =30

FORWARD PASS CALUCLATION: BACKWARD PASS CALUCLATION:

1 = 0 1 =0 5 = 5 = 46 5 = 46
2 = 20
2 = 1 + 12 = 0 + 20 = 20 4 = 5 45 = 46 10 = 36 4 = 36

3 = 2 + 23 = 20 + 1 = 30 3 =30 3 = 4 45 = 36 6 = 30 3 = 30

4 = { + 4 } = {(2 + 24 ) 2 = { 2 } = {(3 23 )
(3 + 34 )} , i=2, 3 4 = 36 2 = 20
(4 24 )} , J= 3,4
= {(20 + 12), (30 + 6)} =Max {32, 36} =36 = {(30 10), (36 12)} =Min {20,14} =20

5 = 4 + 45 = 36 + 10 = 46 5 = 46 1 = { 1 } = {(2 12 )
(3 13 )} , J=2, 3
= {(20 20), (30 25)} =Min {0,5} =0 1 =

Activity Duration Earliest time Latest time Total float

(i.j) of time Starting Finishing time Starting Finishing time
( ) ( ) ( = + ) ( ) T-F=( )
(1) (2) (3) (4)=(3)+(2) =
(5)=(6)-(2) (6) (7)=(5)-(3)
1-2 20 0 20 0 20 0
1-3 25 0 25 5 30 5
2-3 10 20 30 20 30 0
2-4 12 20 32 24 36 4
3-4 6 30 36 30 36 0
4-5 10 36 46 36 46 0
From the above table we observe that the activities 1-2, 2-3, 3-4, and4-5 are critical
activities as their total float is 0. Hence we have the following critical path
1-2-3-4-5 with the total project duration is 46 days.

7
Problem-3:
Find the critical path and calculate the slack time for each event for the following PERT
diagram.

2 6

2 5 1

2
4
1 3 7
5 8 9
8 3
1
5
4 5
3

Solution:

FORWARD PASS CALUCLATION: BACKWARD PASS CALUCLATION:

1 = 0 1 =0 9 = 9 = 15 9 = 0

2 = 1 + 12 = 0 + 2 = 2 2 = 2 8 = { 8 } = {(9 89 )
J= 1 8 = 12
3 = 1 + 13 = 0 + 2 = 2 3 =1 = {(15 3) = (12) =Min {12}

4 = 1 + 14 = 0 + 1 = 1 5 = {(9 59 ) = {(15 5))} = {10} =10 5 = 10

4 = 1
6 = 2 + 26 = 2 + 4 = 6 6 = {(8 86 ) = {(12 1))} = {11} =11
6 = 11
7 = 7
7 = 3 + 37 = 2 + 5 = 7
7 = {(8 87 ) = {(12 4))} = {8} =8
7 = 8
5 = { + 5 } = {(3 + 35 )
(4 + 45 )} , i= 4,3 3 = { 3 } = {(5 35 )
= {(2 + 8), (1 + 3)} =Max {10, 4} =10 6 =11 (7 37 )} , J= 3,7 3 = 2
= {(10 8), (8 5)} =Min {2,3} =2
8 = { + 8 } = {(6 + 68 ) 4 = 7
(7 + 78 )} , i=6, 7 4 = {(5 45 ) = {(10 3))} = {7} =7
= {(6 + 1), (7 + 4)} =Max {7, 11} =11
8 =11
9 = { + 9 } = {(8 + 89 ) 2 = {(6 26 ) = {(11 4))} = {7} =7 2 = 7
(5 + 59 )} , i=8, 5
= {(11 +8 3), (10 + 5)} =Max {14, 15} =15
9 =15
 1 = { 1 } = {(2 12 ) 1 == 0
(3 13 ) (4 14 )} , J= 2, 3, 4
= {(7 2), (2 2)(7 1)} =Min {5, 0, 6} =0

These values can be represented in the following network diagram.

2 =7
2 = 7 6 =11
4 6 =16

2 6

2 3 =2 5 1
8 =11 9 =15
3 =2 9 =15
8 =12
2 3
4
1 3 7
5 8 9
1 = 0, 8 7 =7
1 = 0 7 =8
1
5
4 5
3

4 =1 5 =10
4 =7 5 =10

Activity Duration Earliest time Latest time Total float

(i.j) of time Starting Finishing time Starting Finishing time
( ) ( ) ( = + ) ( ) T-F=( )
(1) (2) (3) (4)=(3)+(2) =
(5)=(6)-(2) (6) (7)=(5)-(3)
1-2 2 0 2 5 7 5
1-3 2 0 2 0 2 0
1-4 1 0 1 6 7 6
2-6 4 2 6 7 11 5
3-7 5 2 7 3 8 1
3-5 8 2 10 2 10 0
4-5 3 1 4 7 10 6
5-9 5 10 15 10 15 0
6-8 1 6 7 11 12 5
7-8 4 7 11 8 12 1
8-9 3 11 14 12 15 1

9
[PERT]
In the net work analysis it is implicitly assumed that the time values are deterministic or
variations in time are insignificant. This assumption is valid in regular jobs such as
i. Maintenance of machine.
ii. Construction of a building or a power
iii. Planning for production.
As these are done from time and various activities could be timed very well

However in reach projects or design of a gear box of a new machine various

Activities .are based on judgment. A reliable time estimate is difficult to get because the technologies
is changing the job? the pert approach taxes into account the uncertainties associated with in that
activity.
DEFINATIONS:
1. OPTIMISTIC TIME: the optimistic time is the shortcut possible time in which the activity can be
finished. It assumes that everything goes very well. This is denoted by
2. MOST LIKELY TIME; the most likely time is the estimate of the activity would take. This
assumes normal delays. If a graph is plotted in the time of completion and the frequency of
completion in that time period than the most likely time will represent the highest frequency of
a occurrence. This is denoted by .
3. PESIMISTIC TIME; the pessimistic time represents the longest time the activity could take if
everything goes wrong. As in optimistic estimate. This value may be such that value. This is
denoted by
These 3 types values are, shown in the following diagram in order to obtain these values; one could
use time values available similar jobs. But most of the time the estimator may not be so fortunate to
have this data. Secondary values are the functions of manpower, machines and supporting facility
.A better approaches would be to seek opinion of experts in the field keeping in views the resources
available, this estimate does not take into account such natural catastrophes as fire etc.

In pert calculation all values are used to attain the percent exportation value.
4.EXPECTED TIME; the expected time is average time an activity will take if it were to be
reported on large number of times and it is base on the assumption that the activity time follows
Bets distribution. This is given by the formula

+ +4
=( )
6

5. VARIANCE: the variance for the activity is given by the formula

2
( )
2 = [ ]
6

Where = . 2 =
= the pessimistic time. =the expected time.
= .

10
 Frequency

Most likely time

Pessimistic Time
O
Optimistic time
Time

Problem-1: for the project represented by the network diagram, find the earliest time and latest
times to reach each node given the following data.

TASK A B C D E F G H I J K
LEAST TIME 4 5 8 2 4 6 8 5 3 5 6
GREATEST 8 10 12 7 10 15 16 9 7 11 13
TIME
MOST LIKELY 5 7 11 3 7 9 12 6 5 8 9
TIME

2
A
B

C
K
1 6 8
4
E
F
D H

3 5 7 9
G J
G

11
SOLUTION;
+ +4
First we calculate the expected time by the formula = ( ) as follows
6
Task Optimistic Pessimistic Most likely time Expected time
time( ) time( ) ( ) ( )
A 4 8 5 =
(4+8+4(5)
= 5.3
6
B 5 10 7 =
(5+10+4(7)
=7.2
6
C 8 12 11 =
(8+12+4(11)
=10.7
6
D 2 7 3 =
(2+7+4(3)
=3.5
6
E 4 10 7 =
(4+10+4(7)
=7
6
F 6 15 9 =
(6+15+4(9)
=9.5
6
G 8 16 12 =
(8+16+4(12)
=12
6
H 5 9 6 =
(5+9+4(6)
=6.3
6
I 3 7 5 =
(3+7+4(5)
=5
6
J 5 11 8 =
(5+11+4(8)
=8
6
K 6 13 9 =
(6+13+4(9)
=9.1
6

Now the earliest time expected time for each note are obtained by taking sum of the expected
times for all the activities leading to node i, when more than one activity leads to a node i, the
maximum of is called.

FORWARD PASS CALUCLATION: BACKWARD PASS CALUCLATION:

1 = 0 1 =0 9 = 9 = 32.5 9 = 32.5

2 = { + 2 } = {(1 + 12 ) 8 = 8 = 34.9
2 = 5.3 8 = 34.9
=0+5.3=5.3
7 = {(9 79 ) = {(32.5 8))} = 24.5 7 = 24.5
3 = 1 + 13 = 0 + 3.5 = 3.5 3 = 3.5
6 = {(8 86 ) = {(34.9 9.11))} = 25.9
4 = { + 4 } = = 2,1 {(2 + 24 ) 6 = 11
(1 + 14 ) = max{5.3 + 7.2) (0 + 10.4)} 5 = { 5 } = {(5 56 )
=max {12.5,10.4} =12.5 (7 57 )} , J= 3,7 5 = 25.8
4 = 12.5
= {(25.8 6.3), (24.5 5)} =Min {19.5,19.5} =2
5 = { + 5 } = = 3,4 {(3 + 35 )
(4 + 45 ) = max{3.5 + 9.5) (12.5 + 7)}
4 = {(5 54 ) = {(19.5 7))} = 12.5 4 = 12.5
=max {13,19.5} =19.5
5 = 19.5
6 = 5 + 65 = 19.5 + 6.3 = 25.8 6 =25.8 3 = { 3 } = {(5 35 ) 3 = 10
7 = { + 7 } = = 5,3 {(5 + 57 ) (7 37 )} , J= 5,7
(3 + 37 ) = max{19.5 + 5) (12 + 3.5)} = {(19.5 9.5), (34.5 12)} =Min {10,12.5} =10
=max {15.5,24.5} =24.5 = 24.5 2 = 7
7 2 = {(6 26 ) = {(11 4))} = 7
8 = 6 + 68 = 25.8 + 9.1 = 34.9 8 =34.9 1 = { } = {(2 12 )
(4 24 )} , J= 2,4 1 = 0
9 = 7 + 12
79 = 24.5 + 8 = 32.5 9 =32.5 = {(5.3 5.3), (12.5 3.5)} =Min {0,9} =0
 TASK A B C D E F G H I J K
LEAST TIME 4 5 8 2 4 6 8 5 3 5 6
GREATEST 8 10 12 7 10 15 16 9 7 11 13
TIME
MOST LIKELY 5 7 11 3 7 9 12 6 5 8 9
TIME
Estimation Time 5.3 7.2 10.7 3.5 7 9.5 12 6.3 5 8 9.2

These calculations are may be arranged in the following table.

NODE SLACK( )

1 5.3 5.3 5.3 0

2 3.5 3.5 10.0 6.5
3 7.2 12.5 12.5 0
4 7 19.5 19.5 0
5 6.3 25.8 25.8 0
6 5 24.5 24.5 0
7 9.1 34.9 34.9 0
8 8.0 32.5 32.5 0

2 =5.3
2 = 5.3
2
A(5.3)
B(7.2) 8 =34.9
6 =25.8
8 =34.9
4 =12.5 6 =25.8
C(10.4) 4 =12.5 K(9.1)
1 6 8
4
1 = 0, F=9.5 E(7)
1 = 0
D(3.5) H(6.3)

3 5 7 9
G(12) J(8)
I (5)
3 =3.5 5 =19.5 7 =24.5 9 =32.5
3 =10.0 5 =19.5 7 =24.5 9 =32.5

13
PROBLEM-2: A project has the following characteristics

ACTIVITY 1-2 2-3 2-4 3-5 4-5 4-6 5-7 6-7 7-8 7-9 8-10 9-10
MOST 1 1 1 3 2 3 4 6 2 5 1 3
OPTEMESTI
TIME(a)
MOAST 5 3 5 5 4 7 6 8 6 8 3 7
PESSIMESTIC
TIME(b)
MOST LIKELY 1.5 2 3 4 3 5 5 7 4 6 2 5
TIME(m)
Construct a PERT network. Find critical path and variance for each event find the project
duration as 95% probability.

SOLUTION: Activity expected times & their variances are computed by the following formula

+ +4 ()2
Expected time ( ) = ( ). V=
6 6

Activity a b 4m V
1-2 1 5 6 =
(1+5+4(1.5)
6
=2 4/9

2-3 1 3 8 =
(1+3+4(2)
6
=2 1/9

2-4 1 5 12 =
(1+5+4(3)
6
=3 4/9

3-5 3 5 16 =
(3+5+4(4)
6
=4 1/9

4-5 2 4 12 =
(2+4+4(3)
6
=3 1/9

4-6 3 7 20 =
(3+7+4(5)
6
=5 4/9

5-7 4 6 20 =
(4+6+4(5)
6
=5 1/9

6-7 6 8 28 =
(6+8+4(7)
6
=7 1/9

7-8 2 6 16 =
(2+6+4(4)
6
=4 4/9

7-9 5 8 24 =
(5+8+4(6)
6
=6.16 1/9

8-10 1 3 8 =
(1+3+4(2)
6
= 21 1/9

9-10 3 7 20 (3+7+4(5)
6
=5 4/9

3 =4 3 5 =8
9 =139/6
3 =8 5 =12
3 9 =139/6
1 = 0,
1 = 0 4 3
1 7 =17 10 =169/9
5 9
7 =17 10 =169/9
1
2 5
7 1 1
1
1 2
2
4
3 1
2 =2
6 8
2 =2 4 =5
14 4 =5 6 =10 8 =17
6 6 =10 8 =127/6
 FORWARD PASS CALUCLATION: BACKWARD PASS CALUCLATION:
169
1 = 0 1 =0 10 = 10 = 9 = 32.5
6

2 = { + 2 } = {(1 + 12 ) =0+2=2 2 = 2 169 139 9 = 1396

9 = 10 910 = 6
5= 6
3 = 2 + 23 = 2 + 2 = 4 3 = 4
139 127 9 = 1276
8 = 10 810 = -2=
6 6
4 = 2 + 24 = 2 + 3 = 5 4 = 5 7 = { 7 } = {(8 78 )
7 = 17
(9 79 )} , J= 8,9
5 = { + 5 } = = 3,4 {(3 + 35 ) 127 139 37
(4 + 45 ) = max{5 + 3) (4 + 4)} = (8,8) = {( 6
2) , (6
6
)} =Min {19.5,17} =17
5 = 8
6 = 4 + 46 = 5 + 5 = 10 6 = {(7 67 ) = {(17 7))} = 10 6 = 10
6 = 10

7 = { + 7 } = = 5,6 {(5 + 57 ) 5 = {(7 57 ) = {(17 5))} = 12 5 = 12

(6 + 67 ) = max{8 + 5) (10 + 7)}
=max {13,17} =17 4 = {(6 46 ) = {(10 5))} = 5 4 = 5
7 = 17
8 = 7 + 78 = 7 + 2 = 19 8 = 17 3 = {5 35 } = {12 4) = 8 3 = 8
9 = 7 + 79 = 17 +
37
=
139 139
6 6 2 = 2 = { 2 } = {(3 23 )
6 (4 24 )} , J= 3,4
10 = { + 10 } = = 8,9 {(8 + 89 ) = {(8 2), (5 3)} =Min {6,2} =2 2 = 2
139
(9 + 910 ) = max{19 + 2) ( 6 + 5)}
169 169
=max {21, }= 6 169
1 = {2 12 } = {2 2) = 0 1 = 0
6 10 = 6

The longest path is 1-2-4-6-7-9-10 can be traced. This is known as critical path.
PROBLEM ON PROJECT CRASHING:
The following table gives data on normal time, and cost crash time and cost for a project
Activity Normal Crash
Time (weeks) Cost(Rs/-) Time (weeks) Cost(Rs/-)

1-2 3 300 2 400

2-3 3 30 3 30
2-4 7 420 5 580
2-5 9 720 7 810
3-5 5 250 4 300
4-5 0 0 0 0
5-6 6 320 4 410
6-7 4 400 3 470
6-8 13 780 10 900
7-8 10 1000 9 1200

Indirect cost is 50/- per week.

15
 Draw the network diagram for the project and identify the critical path.
What is the normal project duration associated cost?
Find out the total float associated with each activity.
Crash the relevant activities systematically and determine the optimal project completion
time cost.

Solution:
4 =10
4 =12 7 =22
4 7 =22

7 0 6 =18 7
4
6 =18

6
9
5 6 10
1 2
3 5 =12
5 =12
1 =0 8 =32
2 =3 8 =32
1 = 0
3 5 13
2 = 3
8
3

3 =6
3 =7

16
17