Project Management

CPM and PERT (Part 1)

  Construction of CPM Network
 Finding the Critical Path and Completion Time
Objectives  Computation of Free Floats
 Computation of Total Floats for Non-Critical Activities
  A project consists of interrelated activities which are to
PROJECT be executed in a certain order before the entire task is
MANAGEMENT completed
 PROJECT  The activities are interrelated in a logical sequence
which is known as precedence relationship
MANAGEMENT
  Project is represented in the form of a network for the
PROJECT purpose of analytical treatment to get solutions for
MANAGEMENT scheduling and controlling its activities
Basic Techniques  CPM – Critical Path Method
In Project  PERT – Project Evaluation and Review Techniques
Management
 Phases of  Planning
 Scheduling
Project
 Controlling
Management
  Planning
 Dividing the project into distinct activities.
Phases of  Estimating time requirement for each activity

Project  Establishing Precedence relationships among the

activities
Management  Construction of the arrow diagran
  Scheduling
Phases of  Determines the start and end time of each and every
Project activity

Management
  Controlling
Phases of  Uses the arrow diagram and time chart for continuous
Project monitoring and progress reporting

Management
Guidelines for  The starting event and ending event of an activity are
Network called tail event and head event, respectively

Construction
Guidelines for  The network should have a unique starting node (tail
Network event)

Construction
Guidelines for  The network should have a unique completion node
Network (head event)

Construction
Guidelines for  No activity should be represented by more than one arc
Network in the network

Construction
Guidelines for  No two activities should have the same starting node
Network and the same ending node

Construction
Guidelines for  Dummy activity is an imaginary activity indicating
Precedence relationship only. Duration of dummy
Network activity is zero.
Construction
  The Critical Path of a project network is the longest path
Critical Path in the network
  This can be identified by simply listing out all the
possible paths from the start node of project to the end
Critical Path node of the project and then selecting the path with the
maximum sum of activity times on that path
  There are two phases in order to find the critical path
 1. Determines earliest start times (ES) of all the nodes.

Two Phases This is called the Forward Pass

 2. Determines latest completion times (LC) of various
nodes. This is called the Backward Pass.n
Determination
of Earliest Start Esj= Maxi (Esi + Dij)
Times (Esj)
Determination of
Latest Completion LCi = Minj (LCj - Dij)
Times (Lci)
 Esi = Lci

Conditions for Esj = Lcj

Critical Path Esj – Esi = Lcj – Lci = Dij
  It is the amount of time that the completion time of an
activity can be delayed without affecting the project
Total Floats completion time.

TFij = LCj – Esi - Dij

  It is the amount of time that the completion time of an
activity can be delayed without affecting the earliest
start time of immediate successor activities in the
Free Floats network.
FFij = ESj – Esi - Dij
  Any Critical activity will have zero total float and zero
Note: free float.
  Consider the details of a project as shown in the table
Situation 1
 ACTIVITY IMMEDIATE DURATION
PREDECESSOR( (WEEKS)
S)
A - 2
B - 5
C - 4
D B 5
E A 7

Situation 1 F
G
A
B
3
3
H C,D 6
I C,D 2
J E 5
K F,G,H 4
L F,G,H 3
M I 12
N J,K 8
  REQUIRED
 Construct the CPM network

Situation 1  Determine the Critical Path and Project Completion time

 Compute total floats and free floats for non-critical
activities