Network Analysis CPM & Pert
Network Analysis CPM & Pert
Network Analysis CPM & Pert
Ankit Mahindrakar
Dhananjay Patil
Gaurang Panigrahi
Santosh Shelke
Rohit Bhopi
Javed
Project
Network Analysis
Introduction
Network analysis is the general name given to certain specific
techniques which can be used for the planning, management and
control of projects.
One definition of a project:
A project is a temporary endeavour undertaken to create a
"unique" product or service
NETWORK TECHNIQUES
Developed in 1950s
CPM by DuPont for chemical plants
PERT by U.S. Navy for Polaris missile
NETWORK TECHNIQUES
PERT
-Program Evaluation and
Review Technique
- developed by the US
Navy with Booz
Hamilton Lockheed
- on the Polaris
Missile/Submarine
program 1958
CPM
Critical Path Method
Developed by El Dupont
for Chemical Plant
Shutdown Project- about
same time as PERT
Activity on Node
Activity on Arrow
- A completion of an activity is
represented by a node
Activity Slack
Each event has two important times associated with it :
- Earliest time ET , which is a calendar time when a event can occur when all
the predecessor events completed at the earliest possible times
- Latest time LT , which is the latest time the event can occur with out
delaying the subsequent events and completion of project.
Difference between the latest time and the earliest time of an event is the
slack time for that event
Positive slack : Slack is the amount of time an event can be delayed without
delaying the project completion
9
Benefits of CPM/PERT
10
Completion date?
On Schedule?
Within Budget?
Critical Activities?
How can the project be finished early at the least cost?
11
Activity
Description
Immediate
predecessors
Design Component
Make Component
Assemble product
A,C
Sequence of activities
Can start work on activities A and B anytime, since
neither of these activities depends upon the
completion of prior activities.
Activity C cannot be started until activity B has been
completed
Activity D cannot be started until both activities A and
C have been completed.
2
Nodes correspond to the beginning
and ending of activities
14
Immediate
predecessors
A
A
A
E
D,F
B,C
G,H
Completion
Time (week)
5
6
4
3
1
4
14
12
2
Total
51
16
t = expected activity
time
17
4
1
3
Earliest start time rule:
The earliest start time for an activity leaving a
particular node is equal to the largest of the earliest
finish times for all activities entering the node.
18
2
LS = latest start
time
19
20
5
7
4
1
3
Latest finish time rule:
The latest finish time for an activity entering a
particular node is equal to the smallest of the latest
start times for all activities leaving the node.
21
2
ES
5
LS
8
EF
9
EF
12
LF-EF = 12 9 =3
LS-ES = 8 5 = 3
LF-ES-t = 12-5-4 = 3
22
A
B
C
D
E
F
G
H
I
23
Earliest
start (ES)
0
0
5
5
5
6
10
9
24
Latest
start (LS)
0
6
8
7
5
6
10
12
24
Earliest
Latest
finish (EF) finish (LF)
5
6
9
8
6
10
24
21
26
5
12
12
10
6
10
24
24
26
Slack
(LS-ES)
0
6
3
2
0
0
0
3
0
Critical
path
Yes
Yes
Yes
Yes
Yes
IMPORTANT QUESTIONS
What are the scheduled start and completion times for each activity?
ES, EF, LS, LF are given for each activity.
How long can non-critical activities be delayed before they cause a delay in
the projects completion time
Slack time available for all activities are given.
24
1.
Slack or Float shows how much allowance each activity has, i.e. how
long it can be delayed without affecting completion date of project
2.
3.
4.
25
6.
7.
8.
9.
26
Limitations to CPM/PERT
Thank you