0% found this document useful (0 votes)
48 views29 pages

CPM and PERT 1

PERT and CPM are techniques used in network analysis for project management, planning, and control of projects. PERT is used for non-repetitive projects where time estimates are uncertain, using probabilistic times. CPM is used for repetitive projects where times can be predicted with past experience, using deterministic times. Both techniques involve modeling the project as a network of activities and events to identify the critical path - the longest sequence of activities that determines the project duration.

Uploaded by

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

CPM and PERT 1

PERT and CPM are techniques used in network analysis for project management, planning, and control of projects. PERT is used for non-repetitive projects where time estimates are uncertain, using probabilistic times. CPM is used for repetitive projects where times can be predicted with past experience, using deterministic times. Both techniques involve modeling the project as a network of activities and events to identify the critical path - the longest sequence of activities that determines the project duration.

Uploaded by

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

PERT & CPM

SUBMITTED BY:-
SHASHANK KAPOOR
MECHANICAL , 154169
What is the PERT& CPM?

It is nothing but the technique used in Network analysis


of project management, such as planning ,
management and control of project.

So, what is project ??


“A project is a series of activities directed
to accomplishment of a desired objective.”

Plan your work first…..then work your plan


Project Evaluation & Review
Techniques
(PERT)
In PERT is basically a method to analyze the tasks involved in
completing a given project, especially the time needed to complete each task,
and to identify the minimum time needed to complete the total project.
– Multiple time estimates
– Probabilistic activity times

USED IN : Project management - for non-repetitive jobs


(research and development work), where the time and cost
estimates tend to be quite uncertain. This technique uses
probabilistic time estimates.
Critical Path Method
(CPM)
In CPM activities are shown as a network of
precedence relationships using activity-on-node network
construction.
– Single estimate of activity time
– Deterministic activity times

USED IN : Production management - for the jobs of


repetitive in nature where the activity time
estimates can be predicted with considerable
certainty due to the existence of past experience.
KEY ELEMENTS
 Arrows:- leading from tail to head directionally Indicate
Activity
 Nodes:- Indicate Event, a point in time where one or more activities start
and/or finish.
 Earliest time:It is categorized in two sub elements.
1. Earliest Starting time (ES):-Time at which the activity can
start
2. Earliest finishing time(EF):-Equals to the earliest start time
for the activity plus the time required to complete the
activity
 Latest time :It is categorized in two sub elements.
1.Latest Starting time (LS):-Time in which the activity can be
completed without delaying
2.Latest Finishing time (LF):-equal to the latest finish time minus the time
required to complete the activity.
 Slack time:-The difference between its earliest and latest start time.
 Critical Path:-The path of activities having zero Slack time.
KEY ELEMENTS
 Optimistic time (a): – It is the shortest time in which the activity
can be completed.
 Most likely time (m) – It is the probable time required to perform
the activity.
 Pessimistic time (b)– It is the longest estimated time required to
perform an activity .
 Expected time (Te) – approximation time taken to complete an
activity.
𝒂+𝟒𝒎+𝒃
Te=
𝟔
 Standard deviation ( ) – Higher the SD is the greater amount of
uncertainty exists
𝑏−𝑎
= 6
 Variance (𝝈𝟐 ) − Large variance indicates great uncertainty, a small
variance indicates a more accurate estimate
ILLUSTRATION ON PERT
SOLUTION

Activity Optimistic Most Pessimisti Expected Standard


Time (a) likely c Time (b) Time (Te) Deviation
Time(m)
1-2 1 1 7 2 1
1-3 1 4 7 4 1
1-4 2 2 8 3 1
2-5 1 1 1 1 0
3-5 2 5 14 6 2
4-6 2 5 8 5 1
5-6 3 6 15 7 2
SOLUTION
CRITICAL PATH

 Paths:-
1-2-5-6 = 2+1+7=10
1-3-5-6 = 4+6+7=17
1-4-6 = 3+5=8

 1-3-5-6 is critical path since it take maximum time.


CRITICAL PATH

NODE LC-ES TOTAL


1 0-0 0
2 9-2 7
3 4-4 0
4 12-3 9
5 10-10 0
6 17-17 0

On Analyzing the Node which having total =0 is 1-3-5-6


Hence it is critical path
PROBABILISTIC
DETERMINATION
 What is the Probability of it taking 20 weeks?

Critical Path = 1-3-5-6= 17 weeks


T =20 weeks C= 17 weeks
𝑧 = 𝑇−𝐶2
𝜎
(Variance) 𝜎 2 = 1 + 4 + 4 = 9
𝑧 = 20−17
9
=1
Look up Zvalue in normal distribution table
Pz= 0.8413 or 84.13%
Going over 20 weeks would be 100 – 84.13 = 15.87%
(Probability of it taking 20 weeks)
ILLUSTRATION ON CPM
SOLUTION
SOLUTION
SOLUTION
SOLUTION
SOLUTION
SOLUTION
SOLUTION
SOLUTION
SOLUTION
SOLUTION
SOLUTION
CRITICAL PATH

 Paths:-
 1-2-5-7-8=2+1+2+1=6 days
 1-3-5-7-8=3+2+2+1=8 days
 1-3-6-7-8=3+5+3+1=12days
 1-4-6-7-8=4+7+3+1=15 days

1-4-6-7-8 is critical path since it take maximum


time.
CRITICAL PATH

NODE LC-ES TOTAL


1 0-0 0
2 11-2 9
3 6-3 3
4 4-4 0
5 12-5 7
6 11-11 0
7 14-14 0
8 15-15 0

On Analyzing the Node which having total =0 is 1-4-6-7-8


Hence it is critical path
What happen if we have large
number of Network problem??
Conclusion

 For large number of network problem Ford


Fulkerson Max Flow Algorithm is the point
that can give us the optimal critical path
since it is use for finding the maximum flow
in a flow network for single source and single
sink.
THANK YOU

You might also like