4.0 How Primavera Works (By CPM)
4.0 How Primavera Works (By CPM)
Lesson Outline
Learning Objectives
Introduction
From the start event to the end event, the time required to complete
all the activities of the project in the specified sequence is known as the
project completion time.
1
Path In A Project
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
Predecessor
Activity Duration (Weeks)
Activity
A - 3
B A 5
C A 7
D B 10
E C 5
F D,E 4
2
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:
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
Path II
A C E F
1 2 4 5 6
3 7 5 4
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
3
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.
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
Path I
A D G K
1 2 5 8 10
8 20 8 6
4
Path II
B E H K
1 3 6 8 10
10 16 11 6
Path III
B E I L
1 3 6 9 10
10 16 14 5
Path IV
C F J L
1 4 7 9 10
7 25 10 5
C F J L
1 4 7 9 10
7 25 10 5
5
Draw the network diagram and determine the critical path for the
following project:
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
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
6
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
Path II
B E I K 9
1 3 6 8
6 7 5 4
Path III
B F J
1 3 7 9
6 10 6
Path IV
C 4 5
1 4 7 9
3 4 6
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:
7
D E I K
1 3 6 8 9
6 7 5 4
Questions
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.
****
8
Earliest And Latest Times
Lesson Outline
Learning Objectives
Introduction
Key concepts
We can consider (i) Earliest Start Time of an activity and (ii) Earliest
Finish Time of an activity.
9
Earliest Start Time of an activity is the earliest possible time of
starting that activity on the condition that all the other activities preceding
to it were began at the earliest possible times.
We can consider (i) Latest Finish Time of an activity and (ii) Latest
Start Time of an activity.
The total float of an activity is the time by which that activity can
be delayed without delaying the whole project. It is given by the formula
10