1

Question 3:

3. The company wants to implement the new project. The following are the
activities required to complete the project, the precedence relationship of
the activities and the activity estimates (in weeks) also given as below.

Activity Code Precedence Optimistic Most likely Pessimistic

Requirement (to) tm tp
A - 5 8 17
C A 3 12 15
D C 4 7 10
B A 5 8 23
E - 1 1 1
F E 1 4 13
I B,D 3 6 9
M F,I 1 2.5 7
G - 1 1 1
H G 2 2 2
K H 5 8 11

Draw the network diagram; determine the earliest and latest activity times,
the expected time of completion, standard deviation, and the probability
that the project will be completed in 40 weeks or less.

Answer:

Activity Optimistic Most Pessimistic Expected Variance Standard

Code (to) likely (tp) time (vt) deviation
(tm) (te) (sd)
A 5 8 17 9 4 2
C 3 12 15 11 4 2
D 4 7 10 7 1 1
B 5 8 23 10 9 3
E 1 1 1 1 0 0
F 1 4 13 30 4 2
I 3 6 9 36 1 1
 2

M 1 2.5 7 3 1 1
G 1 1 1 1 0 0
H 2 2 2 2 0 0
K 5 8 11 8 1 1

Note:

Te = (to+4tm+tp)
6

2
Vt = Tp-to

1. Network diagram

a. CPM Network diagram

C
2 4
A
1 D 9
11
3 F,1
A

5 6
E

7 8 10
G H
 3

b. CPM Network diagram

3,12,15
A completes C completes
5,8,17
4,7,10 B&D completes
Starts
F & I completes

5,8,17 A completes 3,6,9

5,8,23
4,13
Starts 1,4,13
E completes

1,1,1,

Starts F completes H complets

1,1,1, 2,2,2,
 4

2. Calculation of expected time (Mean) for completion

Calculation of Variance

4 1
26.6
13.17 C 7 26.67 D 37
13 26.6
13.17 .50 7 26.67 10.33 37

  4                            
13.1
0 A 7 1
13.1
0 13.17 7 37 I 45.5

9 37 8.5 45.5
27.3
13.17 B 3

22.83 14.17 37 1

                          45.5 M 49.33

0 4 45.5 3.83 49.33

0 E 1.83 1.83 F 7.67

39.6
37.83 1.83 7 39.67 5.83 45.5

                               

0 0 1

0 G 1.83 1.83 H 5.5 5.5 K 17.67

1.83 5.5
0 1.83 1.83 3.67 5.5 12.17 17.67

Variance = 4+4+1+1+1=11 weeks

Standard deviation =√11 = 3.31weeks

Probability of completing the project within 40 weeks

Time expected (Mean) = 49.33weeks

Variance = 11weeks

Standard deviation (sd) =3.31weeks

Weeks for calculating probability (x)=40weeks

 5

Then,

Z = D + te
SD

S=(40-49.33)/3.31

=-9.33/3.31

=-2.82

P(Z) = 0.0024 (as per the Z table)

=>0.24%

Hence the probability of completion of project in 40weeks or less is 0.24%

************

Question 8:

Operations times of servicing of Washing Machines are given below. The first
operation involves cleaning in Machine 1 and the second operation involves
oiling in Machine 2.

a. Determine a sequence that will minimize the total completion time for
this group of jobs, following Johnson’s Rule.
b. Construct a chart of the operations of the jobs at the two work centers
and determine idle time of each line, assuming no other activities are
involved. Processing times (Hrs.) is as follows:
JOBS :A B C D E F
Machine 1 : 5 4 8 2 6 12
Machine 2 : 5 3 9 7 8 15
 6

Answer:

Johnson’s Rule:

It is a unique methodology to determine the optimal sequence of 2 machines

The object of this method is to minimize the total elapses time by n jobs.

a. Finding sequence that will minimize the total completion time for
this group of jobs, following Johnson’s Rule.

Step 1 :

Select the minimum processing time out of all the available values of
processing times, break the tie habitability and Select them.

Step 2:

Analyze the 5 situations and take the decisions accordingly.

Minimum processing time

is on 1st machine M1 for
1 the Pth job. Place Pth job at the beginning of sequence.
Minimum processing time
is on 2nd machine M2 for
2 the Qth job. Place Qth job at the end of the sequence.
Processing time of two
jobs, one on M1 and other
on M2 is equal and both Place Pth job at the beginning of the sequence
3 are minimum. and Qth job at the end of the sequence.
Two jobs are having least Sequence any of the two jobs in tie as first
processing time on and place at the beginning of sequence.
4 machine 1 (M1). Second job of the ties is to be placed next.
Sequence any of the two jobs in tie as last
Two jobs are having least and place it at the end of sequence. Second
processing time on job of the tie is to be placed before the first
5 machine 2 (M2). one.
 7

Step 3:

Now eliminate the job which has already been assigned from further
consideration and repeat step 1 and 2 until an optimal sequence is found.

 In this problem Job consuming minimum time is with D in Machine 1. D

should be placed in 1st from left i.e. at the beginning of the sequence.
 Second lowest value is at B in Machine 2. So B should be placed 1 st from
the right i.e. at the end of the sequence.
 Next lowest vale is at A, in both Machine 1 & 2. It can be placed in 2 nd
from left.
 Next lowest is E in Machine 1. It can be placed 3rd from left.
 Next lowest is at C. So it is taking 4th place from left.
 Remaining job is E and it will take 5th position.
Now the sequence is determined as below:

D A C E F B

b. Construct a chart of the operations of the jobs at the two work centers and
determine idle time of each line, assuming no other activities are involved.
Processing times (Hrs.) is as follows:

JOBS :A B C D E F

Machine 1 : 5 4 8 2 6 12

Machine 2 : 5 3 9 7 8 15
 8

Step 2: Find the total elapsed time.

jobs Machine 1 Machine 2

  Machine 1 in out Time elapses Machine 2 in out Time elapses
D 2 0 0+2= 2 7 2 2+7= 9
A 5 2 2+5= 7 5 9 9+5= 14
C 8 7 7+8= 15 9 14 14+9= 23
E 6 15 15+6= 21 8 23 23+8= 31
F 12 15 21+12= 33 15 31 31+15= 46
B 4 33 33+4= 37 3 46 46+3= 49

Total elapsed time IS 49 hours.

Idle time of Machine 1 is zero

Idle time of Machine 2 is 4

*******************************************************