CPM

Activity Network Diagram PERT Chart

CPM VS PERT Chart

CPM = Critical Path Method

PERT Chart= Project Evaluation and Review Technique
CPM (Critical Path Method)
CPM
 CPM

Detail of Critical Path Precedence Digram

Activity Network Diagram
Activity Network Diagram
Activity Network Diagram Illustration
Activity Network Diagram Illustration
Dependency Tree
Dependency Tree
T9
T7
T3

T10
T11
T1 T4
T6

T12
T2 T5

T8
 T9
T7
T3

T10
T11
T1 T4
T6

T12
T2 T5

T8
 T9
T7
T3

T10
T11
T1 T4
T6

T12
T2 T5

T8
 T9
T7
T3

T1
T10
T6 T11

T2
T4

T12

T8
T5
 T9
T7
T3

T1
T10
T6 T11

T2
T4

T12

T8
T5
 T9
T7
T3

T1
T10
T6 T11

T2
T4

T12

T8
T5
 T9
T3
T7

T1
T10
T6 T11

T2
T4

T12

T8
T5
 T9
T3
T7

T1
T10
T6 T11

T2
T4

T12

T8
T5
 T9
T3
T7

T1
T10
T6 T11

T2
T4

T12

T8
T5
Dependency Tree T9
T3
T7

T1
T10
T6 T11

T2
T4

T12

T8
T5
 Dependency Tree 15
T9
15
T3 20
T7

10
15
T1
5 T10 10
T6 T11

15
T2 10
T4

10
T12
Write duration 25
of each activity 10 T8
T5
Forward Pass
 Forward Pass 15
T9
15
T3 20
0+10=10 T7

0 10 10
15
T1
5 T10 10
T6 T11
0+15=15
0 15 15 0+10=10
T2 0 10 10
T4

10
T12
25
10 T8
Apply early start date
T5
and early finish date
 15
10+15=25
Apply early start date and 10 15 25 T9
early finish date by checking 20
dependency/ predecessor T3
T7

0 10 10
15
T1
5 T10 10
T6 T11

0 15 15
T2 0 10 10
T4

10
T12
25
10 T8
Apply early start date
T5
and early finish date
 15
10 15 25 T9
T3 20
T7

0 10 10
15
T1
5 T10 10
T6 T11

0 15 15
T2 0 10 10
T4

10
T12
15+10=25 25
Apply early start date and
early finish date by checking 15 10 25 T8
dependency/ predecessor but
take max
T5
 15
10 15 25 T9
T3 20
T7

0 10 10
Apply early start date and 15
T1 early finish date by checking
15+5=20
15 5 20 T10 10
dependency/ predecessor but
take max
T6 T11

0 15 15
T2 0 10 10
T4

10
T12
25
15 10 25 T8
T5
 15
10 15 25 T9
10+20=30
T3 10 20 30
T7

0 10 10
15
T1
15 5 20 T10 10
T6 T11

0 15 15
T2 0 10 10
T4

10
T12
25
Apply early start date and
15 10 25 T8
early finish date by checking
dependency/ predecessor T5
 15
10 15 25 T9
T3 10 20 30
T7

0 10 10
15
T1
15 5 20 T10 10
T6 T11

0 15 15
T2 0 10 10
T4

10
10+25=35
T12
10 25 35
Apply early start date and
15 10 25 T8
early finish date by checking
dependency/ predecessor T5
 25+15=40
25 15 40
10 15 25 T9
T3 10 20 30
T7

0 10 10
15
T1
15 5 20 T10 10
T6 T11

0 15 15
T2 0 10 10
T4

10
T12
10 25 35
Apply early start date and
15 10 25 T8
early finish date by checking
dependency/ predecessor T5
 25 15 40
10 15 25 T9
T3 10 20 30 Apply early start date and
early finish date by checking
T7 dependency/ predecessor but
take max
0 10 10 35+15=50
35 15 50
T1
15 5 20 T10 10
T6 T11

0 15 15
T2 0 10 10
T4

10
T12
10 25 35
15 10 25 T8
T5
 25 15 40
10 15 25 T9
T3 10 20 30
T7

0 10 10
35 15 50 40+10=50
T1
15 5 20 T10 40 10 50
T6 T11

0 15 15
T2 0 10 10
T4

10
T12
10 25 35
Apply early start date and
15 10 25 T8
early finish date by checking
dependency/ predecessor T5
 25 15 40
10 15 25 T9
T3 10 20 30
T7

0 10 10
35 15 50
T1
15 5 20 T10 40 10 50
T6 T11

0 15 15
T2 0 10 10
T4
50+10=60
50 10 60
T12
10 25 35
15 10 25 T8 Apply early start date and
T5 early finish date by checking
dependency/ predecessor but
take max
 25 15 40
10 15 25 T9
T3 10 20 30
T7

0 10 10
35 15 50
T1
15 5 20 T10 40 10 50
T6 T11

0 15 15
T2 0 10 10
T4

50 10 60
T12
10 25 35
15 10 25 T8
T5
so total duration days of
project is 60 days
Backward Pass
 25 15 40
10 15 25 T9
T3 10 20 30
T7

0 10 10
35 15 50
T1
15 5 20 T10 40 10 50
T6 T11

0 15 15
T2 0 10 10
T4

50 10 60
60-10=50
T12
10 25 35 50 60
15 10 25 T8
T5 Start with end with same start
and end time
 25 15 40
10 15 25 T9
T3 10 20 30
T7

0 10 10
35 15 50 50-10=40
T1
15 5 20 T10 40 10 50
T6 T11
40 50
0 15 15
T2 0 10 10 Apply late start date by checking
dependency/ predecessorin term of
T4
backword
50 10 60
T12
10 25 35 50 60
15 10 25 T8
T5
 25 15 40
10 15 25 T9
T3 10 20 30
T7

0 10 10 50-15=35
35 15 50
T1
15 5 20 T10 40 10 50
T6 35 50 T11
40 50
0 15 15
T2 0 10 10
T4

50 10 60
T12
10 25 35 50 60
15 10 25 T8
Apply late start date by checking
T5
dependency/ predecessorin term of
backword
 40-15=25
25 15 40
10 15 25 T9
T3 10 20 30 25 40
T7

0 10 10
35 15 50
T1
15 5 20 T10 40 10 50
T6 35 50 T11
40 50
0 15 15
T2 0 10 10
T4

50 10 60
T12
10 25 35 50 60
15 10 25 T8
Apply late start date by checking
T5
dependency/ predecessorin term of
backword
 25 15 40
10 15 25 T9
T3 10 20 30 25 40
T7

0 10 10
35 15 50
T1
15 5 20 T10 40 10 50
T6 35 50 T11
40 50
0 15 15
T2 0 10 10
T4

50 10 60
35-25=10
T12
10 25 35 50 60
15 10 25 T8
Apply late start date by checking
T5 10 35 dependency/ predecessorin term of
backword
 25 15 40
35-20=15
10 15 25 T9
T3 10 20 30 25 40
T7

0 10 10 15 35
35 15 50
T1
15 5 20 T10 40 10 50
T6 35 50 T11
40 50
0 15 15
T2 0 10 10
T4

50 10 60
T12
10 25 35 50 60
15 10 25 T8
Apply late start date by checking
T5 10 35 dependency/ predecessorin term of
backword
 25 15 40
10 15 25 T9
T3 10 20 30 25 40
T7

0 10 10 15 35
35 15 50
T1
15 5 20 T10 40 10 50
T6 35 50 T11
20 25 40 50
0 15 15
0 10 10 25-5=20
T2
T4

50 10 60
T12
10 25 35 50 60
15 10 25 T8
Apply late start date by checking
T5 10 35 dependency/ predecessorin term of
backword
 25 15 40
10 15 25 T9
T3 10 20 30 25 40
T7

0 10 10 15 35
35 15 50
T1
15 5 20 T10 40 10 50
T6 35 50 T11
20 25 40 50
0 15 15
T2 0 10 10
T4

50 10 60
T12
10 25 35 50 60
15 10 25 T8
T5 has no arrow where
its point to so write T5 10 35
samme start and time 15 25
 25 15 40
10 15 25 T9
T3 10 20 30 25 40
T7

0 10 10 15 35
35 15 50
T1
15 5 20 T10 40 10 50
T6 35 50 T11
20 25 40 50
0 15 15 10-10=0 T4 has two arrows where its
T2 0 10 10 point to so, Apply late start
T4 date by checking dependency/
predecessor but take min
0 10
50 10 60
T12
10 25 35 50 60
15 10 25 T8
T5 10 35
15 25
 25-15=10 25 15 40
10 15 25 T9
T3 10 20 30 25 40
10 25 T7

0 10 10 15 35
35 15 50
T1
15 5 20 T10 40 10 50
T6 35 50 T11
20 25 40 50
0 15 15
T2 0 10 10
T4
0 10
50 10 60
T12
10 25 35 50 60
15 10 25 T8
Apply late start date by checking
T5 10 35 dependency/ predecessorin term of
15 25 backword
 25 15 40
10 15 25 T9
T3 10 20 30 25 40
10 25 T7

0 10 10 15 35
35 15 50
T1
15 5 20 T10 40 10 50
T6 35 50 T11
15-15=0
20 25 40 50
0 15 15
T2 0 10 10
0 15 T4
0 10
50 10 60
T2 has two arrows where
T12
its point to so, Apply late
10 25 35 50 60
start date by checking
dependency/ predecessor 15 10 25 T8
but take min T5 10 35
15 25
 T1 has three arrows
where its point to so, 25 15 40
Apply late start date by
T9
checking dependency/ 10 15 25
predecessor but take min T3 10 20 30 25 40
10 25 T7
10-10=0
0 10 10 15 35
35 15 50
T1
15 5 20 T10 40 10 50
0 10
T6 35 50 T11
20 25 40 50
0 15 15
T2 0 10 10
0 15 T4
0 10
50 10 60
T12
10 25 35 50 60
15 10 25 T8
T5 10 35
15 25
Compute CPM & Slack
Look block whose
early start time =late start time 1
25 15 40
early finish time =late finish time CPM
T9
Highlight them and consider 10 15 25
it CPM T3 10 20 30 25 0 40
10 0 25 T7

0 10 10 15 35
35 15 50
T1
15 5 20 T10 40 10 50
0 0 10
T6 35 0 50 T11
20 25 40 0 50
0 15 15
T2 0 10 10
0 0 15 T4 4
0 0 10 CPM
50 10 60
3 T12
2 CPM 10 25 35 50 0 60
CPM
15 10 25 T8
Select those whose slack is zero.
T5 10 0 35 early start time -late start time
15 0 25 early finish time -late finish time
CPM1=10+25+40+50+60=185 weeks
1
CPM2=15+25= 40 weeks 25 15 40
CPM
CPM3=10+25= 35 weeks 10 15 25 T9
CPM4=15+25= 155 weeks T3 10 20 30 25 0 40
10 0 25 T7

0 10 10 15 35
35 15 50
T1
15 5 20 T10 40 10 50
0 0 10
T6 35 0 50 T11
20 25 40 0 50
0 15 15
T2 0 10 10
0 0 15 T4 4
0 0 10 CPM
50 10 60
3 T12
2 CPM 10 25 35 50 0 60
CPM
15 10 25 T8
T5 10 0 35
15 0 25
Finally CPM= 185 weeks
CPM vs PERT
PERT (Project Evaluation
and Review Technique)
 Project Evaluation and Review Technique

Optimistic time: it is the min time in which the activity can be completed under
favourable condition
Most Likely time: It is the time required to complete an activity uner normal condition. or
it is the time required to complete an activity most often if it is repeated number of times
Pessimistic time: it is the max time in which the activity can be completed under
unfavourable condition
CONSIDER THE FOLLOWING TABLE SUMMERIZATION THE DETAIL OF PROJECT

Activity Predecess Durations (wEEKS)

or
0 m p

A - 5 6 7 • Construct project network

B - 1 3 5 • Fimd the expected duration and variance of each
activity
C - 1 4 7 • Find critical path and expected project completion
D A 1 2 3 time
E B 1 2 9 • What the probability of completing project on or
before 22 weeks?
F C 1 5 9
G C 2 2 8
H E,F 4 4 10
I D 2 5 8
J H,G 2 2 8
Construct project network
5 Activity Predece Durations (wEEKS)
D ssor
0 m p
A 2

A - 5 6 7
1
B E B - 1 3 5
3 6
C - 1 4 7
C
D A 1 2 3
E B 1 2 9
4
F C 1 5 9
G C 2 2 8
H E,F 4 4 10
I D 2 5 8
J H,G 2 2 8
 Activity Predece Durations (wEEKS)
ssor
a m b
Construct project network A - 5 6 7
5 B - 1 3 5
D
C - 1 4 7
A 2
D A 1 2 3
E B 1 2 9
1
B E F C 1 5 9
3 6
G C 2 2 8
C
H E,F 4 4 10
F
I D 2 5 8
4
J H,G 2 2 8
 Activity Predece Durations (wEEKS)
ssor
a m b
Construct project network A - 5 6 7
5 B - 1 3 5
D
C - 1 4 7
A 2
D A 1 2 3
E B 1 2 9
1
B E F C 1 5 9
3 6
G C 2 2 8
C
H E,F 4 4 10
F
I D 2 5 8
4
g J H,G 2 2 8
7
 Activity Predece Durations (wEEKS)
ssor
a m b
Construct project network A - 5 6 7
B - 1 3 5
C - 1 4 7
D A 1 2 3
E B 1 2 9
F C 1 5 9
D 5
G C 2 2 8
A 2
H E,F 4 4 10
1 I D 2 5 8
B E
3 J H,G 2 2 8
6
C
F H
4
G
7
 Activity Predece Durations (wEEKS)
ssor
a m b
Construct project network A - 5 6 7
B - 1 3 5
C - 1 4 7
D A 1 2 3
E B 1 2 9
F C 1 5 9
D 5
G C 2 2 8
A 2 I
H E,F 4 4 10
1 I D 2 5 8
B E
3 J H,G 2 2 8
6
C 8
F H
4
G
7
 Activity Predece Durations (wEEKS)
ssor
a m b
Construct project network A - 5 6 7
B - 1 3 5
C - 1 4 7
D A 1 2 3
E B 1 2 9
F C 1 5 9
D 5
G C 2 2 8
A 2 I
H E,F 4 4 10
1 I D 2 5 8
B E
3 J H,G 2 2 8
6
C 8
F H
4 J
G
7
Find the expected duration and variance of each activity

Activity Predecessor Durations (WEEKS) Mean Duration/ Expected Time (t) variance
a m b

A - 5 6 7
B - 1 3 5
C - 1 4 7
D A 1 2 3
E B 1 2 9
F C 1 5 9
G C 2 2 8
H E,F 4 4 10
I D 2 5 8
J H,G 2 2 8
Find the expected duration and variance of each activity

Activity Predecessor Durations (WEEKS) Mean Duration/ Expected Time (t) variance
a m b

A - 5 6 7 6 0.11
B - 1 3 5 3 0.44
C - 1 4 7 4 1.00
D A 1 2 3 2 0.11
E B 1 2 9 3 1.78
F C 1 5 9 5 1.78
G C 2 2 8 3 1.00
H E,F 4 4 10 5 1.00
I D 2 5 8 5 1.00
J H,G 2 2 8 3 1.00
 Activity Predece Durations (wEEKS)
ssor
a m b
Construct project network A - 5 6 7
B - 1 3 5
C - 1 4 7
D A 1 2 3
E B 1 2 9
F C 1 5 9
D(2) 5
A (6) G C 2 2 8
2 I(5)
H E,F 4 4 10
1 I D 2 5 8
B (3) E(3)
3 J H,G 2 2 8
6
C (4) 8
F(5) H(5)
4 J(3)
G(3)
7
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Earliest start time= forwad pass A - 5 6 7

Lastest completion time= backward pass
B - 1 3 5
C - 1 4 7
D A 1 2 3
D(2) 5 E B 1 2 9
A (6) 2 F C 1 5 9
G C 2 2 8
I(5)
H E,F 4 4 10
1 I D 2 5 8
B (3) E(3)
3 J H,G 2 2 8
6
C (4) 8
F(5) H(5)
4 J(3)
G(3)
7
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Earliest start time= forwad pass A - 5 6 7

Lastest completion time= backward pass
B - 1 3 5
C - 1 4 7
D A 1 2 3
INITIAL 0 E B 1 2 9
D(2) 5
A (6) 2 F C 1 5 9
G C 2 2 8
0 I(5)
H E,F 4 4 10
1 I D 2 5 8
B (3) E(3)
3 J H,G 2 2 8
6
C (4) 8
F(5) H(5)
4 J(3)
G(3)
7
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Earliest start time= forwad pass A - 5 6 7

Lastest completion time= backward pass
B - 1 3 5
6+2=8
0+6=6 C - 1 4 7
8 D A 1 2 3
6 E B 1 2 9
D(2) 5
A (6) 2 F C 1 5 9
G C 2 2 8
0 I(5)
H E,F 4 4 10
0+3=3
1 3 I D 2 5 8
B (3) E(3)
3 J H,G 2 2 8
6
C (4) 8
F(5) H(5)
Forwad pass
4 J(3)
0+4=4
G(3)
7
ESj=MAX (ESI + DIJ)
4
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Earliest start time= forwad pass A - 5 6 7

Lastest completion time= backward pass
B - 1 3 5
C - 1 4 7
8 D A 1 2 3
6 E B 1 2 9
D(2) 5
A (6) 2 F C 1 5 9
I(5) G C 2 2 8
0 THIS TIME PICK H E,F 4 4 10
MAX
1 3 I D 2 5 8
B (3) E(3)
3 J H,G 2 2 8
6 9
C (4) 4+5=9 8
F(5) H(5)
Forwad pass
4 J(3)
G(3)
7
ESj=MAX (ESI + DIJ)
4
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Earliest start time= forwad pass A - 5 6 7

Lastest completion time= backward pass
B - 1 3 5
C - 1 4 7
8 D A 1 2 3
6 E B 1 2 9
D(2) 5
A (6) 2 F C 1 5 9
I(5) G C 2 2 8
0
H E,F 4 4 10
1 3 I D 2 5 8
B (3) E(3)
3 J H,G 2 2 8
6 9
C (4) 8
F(5) H(5)
Forwad pass
4 J(3)
G(3)
7 9+5=14 ESj=MAX (ESI + DIJ)
4 14 THIS TIME PICK MAX
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Earliest start time= forwad pass A - 5 6 7

Lastest completion time= backward pass
B - 1 3 5
C - 1 4 7
8 D A 1 2 3
6 E B 1 2 9
D(2) 5
A (6) 2 F C 1 5 9
I(5) G C 2 2 8
0
H E,F 4 4 10
1 3 I D 2 5 8
B (3) E(3)
3 J H,G 2 2 8
6 9 14+3=17
C (4) 8 THIS TIME PICK MAX
17
F(5) H(5)
Forwad pass
4 J(3)
G(3)
7
ESj=MAX (ESI + DIJ)
4 14
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Earliest start time= forwad pass A - 5 6 7

Lastest completion time= backward pass
B - 1 3 5
C - 1 4 7
8 D A 1 2 3
6 E B 1 2 9
D(2) 5
A (6) 2 F C 1 5 9
I(5) G C 2 2 8
0
H E,F 4 4 10
1 3 I D 2 5 8
B (3) E(3)
3 J H,G 2 2 8
6 9 START WITH LAST AND GOES
8 17
C (4) SAME
17
F(5) H(5)
Backward pass
4 J(3)
G(3)
7
LCi=MIN (LCJ - DIJ)
4 14
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Earliest start time= forwad pass A - 5 6 7

Lastest completion time= backward pass
B - 1 3 5
C - 1 4 7
8 D A 1 2 3
6 E B 1 2 9
D(2) 5
A (6) 2 F C 1 5 9
I(5) G C 2 2 8
0
H E,F 4 4 10
1 3 I D 2 5 8
B (3) E(3)
3 J H,G 2 2 8
6 9 START WITH LAST AND GOES
8 17
C (4) SAME
17
F(5) H(5)
Backward pass
4 J(3)
G(3)
7 14 LCi=MIN (LCJ - DIJ)
14 17-3=14
4
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Earliest start time= forwad pass A - 5 6 7

Lastest completion time= backward pass
B - 1 3 5
C - 1 4 7
8 D A 1 2 3
6 E B 1 2 9
D(2) 5
A (6) 2 F C 1 5 9
I(5) G C 2 2 8
0
H E,F 4 4 10
1 3 I D 2 5 8
B (3) 9
3 E(3) J H,G 2 2 8
6 9 START WITH LAST AND GOES
8 17
C (4) 14-5=9 SAME
17
F(5) H(5)
Backward pass
4 J(3)
G(3)
7 14 LCi=MIN (LCJ - DIJ)
4 14
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Earliest start time= forwad pass A - 5 6 7

Lastest completion time= backward pass
B - 1 3 5

12 C - 1 4 7
8 17-5=12 D A 1 2 3
6 E B 1 2 9
D(2) 5
A (6) 2 F C 1 5 9
I(5) G C 2 2 8
0
H E,F 4 4 10
1 3 I D 2 5 8
B (3) 9
3 E(3) J H,G 2 2 8
6 9 START WITH LAST AND GOES
8 17
C (4) SAME
17
F(5) H(5)
Backward pass
4 J(3)
G(3)
7 14 LCi=MIN (LCJ - DIJ)
4 14
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Earliest start time= forwad pass A - 5 6 7

Lastest completion time= backward pass
B - 1 3 5

12 C - 1 4 7
8 D A 1 2 3
6 E B 1 2 9
D(2) 5
A (6) 2 F C 1 5 9
I(5) G C 2 2 8
0
H E,F 4 4 10
1 3 I D 2 5 8
B (3) 9
3 E(3) J H,G 2 2 8
6 9 START WITH LAST AND GOES
8 17
C (4) SAME
17
F(5) H(5)
Backward pass
4 J(3)
4
G(3)
7 14 LCi=MIN (LCJ - DIJ)
PICK MIN 9-5=4
4 14
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Earliest start time= forwad pass A - 5 6 7

Lastest completion time= backward pass
B - 1 3 5

12 C - 1 4 7
8 D A 1 2 3
6 E B 1 2 9
D(2) 5
A (6) 2 F C 1 5 9
I(5) G C 2 2 8
0
6 9-3=6 H E,F 4 4 10
1 3 I D 2 5 8
B (3) 9
3 E(3) J H,G 2 2 8
6 9 START WITH LAST AND GOES
8 17
C (4) SAME
17
F(5) H(5)
Backward pass
4 J(3)
4
G(3)
7 14 LCi=MIN (LCJ - DIJ)
4 14
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Earliest start time= forwad pass A - 5 6 7

Lastest completion time= backward pass
B - 1 3 5
12-2=10 12 C - 1 4 7
10 D A 1 2 3
8
6 E B 1 2 9
D(2) 5
A (6) 2 F C 1 5 9
I(5) G C 2 2 8
0
6 H E,F 4 4 10
1 3 I D 2 5 8
B (3) 9
3 E(3) J H,G 2 2 8
6 9 START WITH LAST AND GOES
8 17
C (4) SAME
17
F(5) H(5)
Backward pass
4 J(3)
4
G(3)
7 14 LCi=MIN (LCJ - DIJ)
4 14
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Earliest start time= forwad pass A - 5 6 7

Lastest completion time= backward pass
B - 1 3 5

12 C - 1 4 7
PICK MIN 10 D A 1 2 3
8
6 E B 1 2 9
4-4=0 D(2) 5
A (6) 2 F C 1 5 9
0
I(5) G C 2 2 8
0
6 H E,F 4 4 10
1 3 I D 2 5 8
B (3) 9
3 E(3) J H,G 2 2 8
6 9 START WITH LAST AND GOES
8 17
C (4) SAME
17
F(5) H(5)
Backward pass
4 J(3)
4
G(3)
7 14 LCi=MIN (LCJ - DIJ)
4 14
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Critical Path is the longest path in a network

A - 5 6 7
CP1=4+3+3=10
B - 1 3 5

12 C - 1 4 7
10 D A 1 2 3
8
6 E B 1 2 9
D(2) 5
A (6) 2 F C 1 5 9
0
I(5) G C 2 2 8
0
6 H E,F 4 4 10
1 3 I D 2 5 8
B (3) 9
3 E(3) J H,G 2 2 8
6 9 START WITH LAST AND GOES
8 17
C (4) SAME
17
F(5) H(5)
Backward pass
CP 1 4 J(3)
4
G(3)
7 14 LCi=MIN (LCJ - DIJ)
4 14
 Activity Predece Durations (wEEKS)
Find critical path and expected project ssor
completion time a m b

Critical Path Expected project completion time

A - 5 6 7
CP1=4+3+3=10 B - 1 3 5
CP2=4+5+5+3= 17 weeks C - 1 4 7
12
10 D A 1 2 3
8
6 E B 1 2 9
D(2) 5
A (6) 2 F C 1 5 9
0
I(5) G C 2 2 8
0
6 H E,F 4 4 10
1 3 I D 2 5 8
B (3) 9
3 E(3) J H,G 2 2 8
6 9 START WITH LAST AND GOES
8 17
C (4) SAME
17
F(5) H(5)
Backward pass
CP 2 4 J(3)
4
G(3)
7 14 LCi=MIN (LCJ - DIJ)
4 14
 Project Variance

Activity Predecess Durations (WEEKS) Mean variance

or Duration/
a m b Expected
Time (t)

CP=4+5+5+3= 17
A - 5 6 7 6 0.11
Activities on critical path=C,F,H,J
B - 1 3 5 3 0.44
=1.00+1.78+1.00+1.00 C - 1 4 7 4 1.00

4.78 D A 1 2 3 2 0.11
E B 1 2 9 3 1.78
F C 1 5 9 5 1.78
G C 2 2 8 3 1.00
H E,F 4 4 10 5 1.00
 
I D 2 5 8 5 1.00
J H,G 2 2 8 3 1.00
=2.18 ROUND OFF=2.19
 • What the probability (z-score) of completing project on or before 22 weeks?
Expected project completion time = 17
Activity Predecess Durations (WEEKS) Mean variance
=2.19 or
a m b
Duration/
Expected
Time (t)

Probability of completing project

on or before 22 weeks A - 5 6 7 6 0.11
B - 1 3 5 3 0.44
P(z<=22)=Due date-Expected date/standard
C - 1 4 7 4 1.00
deviation
where, z=due date D A 1 2 3 2 0.11
E B 1 2 9 3 1.78
P(z<=22)= 22-17/2.19
F C 1 5 9 5 1.78
P(z<=22)= 2.28
G C 2 2 8 3 1.00
H E,F 4 4 10 5 1.00
look Standard Normal I D 2 5 8 5 1.00
distribution table J H,G 2 2 8 3 1.00
Z- score Standard Normal
Distribution Table
P[z<= 2.28]

P[z<= 2.28] =0.9887

Therefore, Probability of
completing project on or
before 22 weeks= 0.9887
i.e 98.87%