0% found this document useful (0 votes)
121 views

A Presentation On: By: Abhay Avhad (121520001) Komal Thabaj (121520013)

This document provides an overview of critical path method (CPM) project management. It discusses key aspects of CPM including the three phases of project management (planning, scheduling, controlling). It also covers network diagrams, the components of a CPM network including activities, events, dummy activities. The document explains the two systems for representing networks - activity on node and activity on arrow. It discusses the steps for numbering events and calculating earliest and latest event times using forward and backward pass. The critical path is identified as the longest path that determines the project completion time.

Uploaded by

abhayavhad51
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
121 views

A Presentation On: By: Abhay Avhad (121520001) Komal Thabaj (121520013)

This document provides an overview of critical path method (CPM) project management. It discusses key aspects of CPM including the three phases of project management (planning, scheduling, controlling). It also covers network diagrams, the components of a CPM network including activities, events, dummy activities. The document explains the two systems for representing networks - activity on node and activity on arrow. It discusses the steps for numbering events and calculating earliest and latest event times using forward and backward pass. The critical path is identified as the longest path that determines the project completion time.

Uploaded by

abhayavhad51
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 29

A Presentation on

CPM
By:
Abhay Avhad (121520001)
Komal Thabaj (121520013)

Introduction
Any project involves planning, scheduling and controlling a

number of interrelated activities with use of limited


resources, namely, men, machines, materials, money and
time.
It is required that managers must have a dynamic planning
and scheduling system to produce the best possible results
and also to react immediately to the changing conditions
and make necessary changes in the plan and schedule.
A convenient analytical and visual technique of CPM prove
extremely valuable in assisting the managers in managing
the projects.
CPM stands for Critical Path Method which was
developed by DuPont Company and applied first to the
construction projects.

Project management generally consists of three phases.


Planning: Planning involves setting the objectives of the project.

Identifying various activities to be performed and determining the


requirement of resources such as men, materials, machines, etc.
Scheduling: Based on the time estimates, the start and finish

times for each activity are worked out by applying forward and
backward pass techniques, critical path is identified, along with
the float for the non-critical paths.
Controlling: Controlling refers to analyzing and evaluating the

actual progress against the plan. Reallocation of resources,


crashing and review of projects with periodical reports are carried
out.

Network?
A network is the diagrammatic representation of a work plan

showing the activities, step-by-step, leading to the


established goal.
It depicts the inter dependence between the various
activities, i.e. which activities can be done together and
which activities must precede or succeed others.
Shows the sequential relationships among activities using
nodes and arrows.

Components of CPM
Network
Activity: An activity represents
an action and consumption
of resources (time, money, energy) required to complete a
portion of a project. Activity is represented by an arrow.

Event: An event (or node) will always occur at the beginning


and end of an activity. The event has no resources and is
represented by a circle.

Merge and Burst Events: One or more activities can start


and end simultaneously at an event.

Preceding and Succeeding Activities: Activities performed


before given events are known as preceding activities, and
activities performed after a given event are known as
succeeding activities.

Activities A and B precede activities C and D respectively.

Dummy Activity: An imaginary activity which does not


consume any resource and time is called a dummy
activity. Dummy activities are simply used to
represent a connection between events in order to
maintain a logic in the network. It is represented by a dotted
line in a network.
3

Dummy
Activity

Network Representation
Two systems of network representation
Activity-on-node (AON):
Nodes represent activities, and arrows show precedence
relationships.
Activity-on-arrow (AOA):

Arrows represent activities and nodes are events for points in


time.

Activity-on-node (AON)
In this system activities are represented on the nodes, and

arrows are used to show the dependency relationships


between the activity nodes.
The time required to complete an activity is also indicated
in the node.

Activity-on-arrow (AOA)
In this system an activity is graphically represented by an

arrow drawn from left to right. The description of the


activity is written above the arrow and the time taken to
complete the activity is written below it.
An event is graphically represented by a number enclosed
in a circle.
2

B
Procure aggregate
& sand
2

D
Concrete slab

4
1

Errors To Be Avoided In Constructing A


Network
a. Two activities starting from
a tail
event must not have a same end
event. To ensure this, it is absolutely
necessary to introduce a dummy
activity, as shown.
b. In a network, there should be only
one start event and one ending event
as shown.
c. Looping error should not be formed
in a network, as it represents
performance of activities repeatedly
in a cyclic manner, as shown.
d. The direction of arrows
should flow from left to right
avoiding mixing of direction as
shown.

Rules In Constructing A Network


No single activity can be represented more than once in a
network. The length of an arrow has no significance.
Event numbered 1 is the start event and an event with
highest number is the end event. Before an activity can be
undertaken, all activities preceding it must be completed.
That is, the activities must follow a logical sequence
between activities.
In assigning numbers to events, there should not be any
duplication of event numbers in a network.
Dummy activities must be used only if it is necessary to
reduce the complexity of a network.
A network should have only one start event and one end
event.

Procedure For Numbering The


Events
Using
Fulkerson's
Step1: Number
the start
or initial event as 1. Rule
Step2: From event 1, strike off all outgoing activities. This
would have made one or more events as initial events (event
which do not have incoming activities). Number that event as
2.
Step3: Repeat step 2 for event 2, event 3 and till the end
event. The end event must have the highest number
Example 1:
Draw a network for a house construction project. The
sequence of activities with their predecessors are given
in Table 8.1, below.

Network Analysis
Earliest Event Time
(TE): It is the earliest possible
occurrence of an event i.e. the earliest possible time when all
activities leading to an event will be completed.
Latest Event Time (Tl):It is defined as the latest possible
occurrence of an event
without delaying the project
completion time i.e. it is the latest time when all activities
leading to an event may be completed without delaying the
project completion time.

Forward Pass
For calculating the earliest event times (TE), computations
are made in a forward direction (left to right). This process is
called the 'forward pass'.
2

1
1
3

Backward Pass
For calculating the latest event times (Tl), computations are
made in a backward direction (right to left). This process is
called the 'backward pass'.
2
3
1
1
3
2

Calculate Event times & Denote critical


path

Draw rectangles for TE& TL

Forward pass for calculating each


Events TE
6

Project duration = 15 days


6

15
8
0

Backward pass for calculating each


events TL
6

15
8

13

15

Backward pass
6

15
8
0

13

0
3

15

Critical Path 1-2-6 & 1-3-5-6


6

15
8
0

13

0
3

15

Critical Path
Analysis
joining the
critical activities

The path
in a network is
called the Critical Path. It is the longest path in the
network and the time along this path determines the
completion time of the project.
The critical path is distinctly shown in the network by double or
bold lines or in red colour.
Further, any delay in completing the critical activities will
increase the project duration.
The activity, which does not lie on the critical path, is
called non-critical activity. These non-critical activities
may have some slack time.

Assignmen
t

THANK
YOU

You might also like