CPM &

PERT
By:
Divya Adhikari (MBA-B&F)
 NETWORK PLANNING

• The Network Planning approach address the problem of

given a location to be provided connectivity using a set of
nodes, determine the minimum cost network topology.
• The goal of network planning is to interconnect different
equipment's in order to share resources among several
users.
NETWORK PLANNING METHODS

Methods used for network

planning are:
1. CPM
2. PERT
 1. CRITICAL PATH METHODS (CPM)

The critical path method (CPM) is a step-by-step project management technique for
process planning that defines critical and non-critical tasks with the goal of
preventing time-frame problems and process bottlenecks. The CPM is ideally suited
to projects consisting of numerous activities that interact in a complex manner.

In simple words, Critical path is the sequence of activities between a project’s start
and finish that takes the longest time to complete.
 EXAMPLE

Paths in the diagram:

A-D-F-G-I = 32
CRITICAL PATH:
A-D-F-H=31
A-C-F-H=29
A-D-F-G-I=32
A-C-F-G-I=30
A-B-E-F-H=30
A-B-E-F-G-I=31
2. PROGRAM EVALUATION AND REVIEW TECHNIQUE

Project management technique that shows the time taken by each

component of a project, and the total time required for its completion. PERT
breaks down the project into events and activities, and lays down their
proper sequence, relationships, and duration in the form of a network. Lines
connecting the events are called paths, and the longest path resulting from
connecting all events is called the critical path. The length (duration) of the
critical path is the duration of the project, and any delay occurring along it
delays the whole project. PERT is a scheduling tool, and does not help in
finding the best or the shortest way to complete a project.
TIME ESTIMATES

o Optimistic time (to)

o Most likely time (tm)
o Pessimistic time (tp)
o Expected time
te= to+4tm+tp
6
EXAMPLE

Activity Precedence Optimistic Most Pessimistic Expected

time likely time time
time
A - 12 16 26 17
B A 6 9 18 10
C A 8 10 18 11
D C 2 3 4 3
E B, D 3 4 11 5
F E 6 8 10 8
G F 15 20 25 20
Paths in the diagram:
CRITICAL PATH:
A-B-E-F-G=60
A-C-D-E-F-G=64
A-C-D-E-F-G= 64
THANK
YOU !