CPM PERT Lec-2

CPM PERT
Civil Engineering
All AE JE Exams Covered
Class Link : https://youtu.be/l4P3dkih7Fg

| Construction Planning &Management | CPM PERT |
8-10-14
2 6
8
6-8-11 4-10-12
1 4 5
4-7-10
9 10
3
7
Compute The Earliest Expected Times and The
Latest Allowable Occurence Times of Various
Events.
ABOUT ME
❖ Teaching Experience: 5+ Years
❖ Qualification: B.Tech in Civil Engg, Postgraduate in Urban
Planning & Development
❖ Achievements:
▪ SSC JE , NBCC , NPCC
▪ GATE
▪ Mentored More Than 50,000+ Students
❖ Area of Expertise: Civil Engineering AE & JE Exams

❖ Designed: Layout of 51 Solar Power Plants for Indian
Railways
➢ Removal of Redundant Dummies

Redundant Dummies are those which are in excess in any network.
Such Dummies makes the Network Lengthy and Calculations

Difficult.
Rules of Removing Redundant Dummies:

A Rules of Removing Redundant

t=0 Dummies:
B 1. If dummy is the only activity
originating from it tail event, it
C
can be removed.
After removing
A Redundant Dummy
C
B
B Rules of Removing Redundant

A Dummies:
t=0
2. If dummy is the only activity
terminating from its Head Event, it
C
can be removed.
After removing
Redundant Dummy
B
A
C
A C Rules of Removing Redundant

Dummies:
3. If 2 activities C and D have the
B D same common set of Predeccessor
Activity A & B then the following
conditions arise.
A C
B D
➢ Rules Of A Network
1. There can be only one initial & one final event.
2. An Event can not occur unless all preceeding activities are

completed.
3. An Event cannot occur Twice in a Network.
4. Number of arrows should be equal to number of

activities.
➢ Rules Of A Network
5. Time should always flow from left to right.
6. Length of arrow does not show any magnitude.
7. Arrows should normally not cross each other. if it is

necessary to cross, one should be bridged over the other.
8. No Activity can Start until its tail event has occured.

➢ Numbering Of Events (FULKERSON'S RULE)
It States “ Through Any Path From Initial Event to

the Final Event in a network, the Number's must
always be Increasing”.
Example:
4 8 9
1 2 3 6 7 10
5
Example 2:
2 4
1 6
3 5
➢ Errors In A Network
2
1. Looping Error A B
Loops Should not be Formed.
1 3
C
2 Right
A B
1 3
C
Wrong
2. Dangling Error
Project is complete only when all its activities are complete
but the duration of activity 'R' has no effect on the project time.
3
Q T
P S U
1 2 4 5
R More than one Final Event
6
3. Redundancy Error
Redundant Dummies are those which are in
excess in any network. Such Dummies makes the
Network Lengthy and Calculations Difficult.
Activity B Activity E
3
A Errors In A Network
t=0 3. Redundancy Error
B Redundant Dummies are those
which are in excess in any network.
C
Such Dummies makes the Network
Lengthy and Calculations Difficult.
After removing
A Redundant Dummy
C
B
➢ PERT
• Based on Probabilistic Approach
• It is event oriented.
• Three types of times are estimated for every
activity.
• Cost is directly proportional to time.
Examples: Reasearch Work, Launching of Space

Aircraft, Development of Missile Programmes, etc.
➢ CPM
• Based on Deterministic Approach.
• It is Activity Oriented.
• Only One Time is calculated for every Activity.
• It is suitable for repititive types of work.
Examples: Construction Work, Maintainence Work,

Civil Engineering Projects.
➢ PERT
(Project Evaluation and Review Technique)
• It Involves Uncertinity into the project completion
time.
• It is a Numerical Technique used in the Projects in
which time can not be estimated accurately such as
research work and development works.
• It is Event Oriented Network.
➢ PERT
Three Times Estimates are Made in PERT:
1. Optimistic Time (t0) :This is the minnimum time in which an

activity can be completed under the most ideal conditions.
2. Pessimistic Time (tp) : This is the maximum time in which an

activity can be completed under the Worst Possible conditions.
3. Most Likely Time (tm) : This is the time required to complete an

activity under normal working conditions. its value lies between
to and tp. It is near to the expected time.
➢ Expected Mean Time (te) :

(Mean Time / Expected Time / Average Time )
• In PERT each activity is assumed to follow β-

Distribution Curve of time.
• This is calculated from β-Distribution Curve of time at
which probability of activity is just 50%.
➢ Expected Mean Time (te) :

(Mean Time / Expected Time / Average Time )
• Time taken by variours activites follow β-Distribution.

• The Value of Expected Time is calculated by :
te = (to + 4tm + tp)

6
➢ Standard Deviation Of An Activity (σ)

• This is the measurement of uncertinity which is
approximately 1/6 of the time ragne.
σ = tp - to
6
It can be seen σ is affected by relative distance
from to to tp
Hence, Wide Range in time estimate represents
greater Uncertainity.
➢ Variance Of An Activity (σ2)

• Wide Range in time estimate represents greater
Uncertainity.
• Greater Uncertainity represents Greater Standard Deviation.
• Greater Standard Deviation Represents Greater Varience.
VARIANCE = (Standard Deviation)2

➢ β-Distribution Curve
It is a curve between Probability of completion of Activity and its
Time.

CPM PERT Lec-2

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CPM PERT Lec-2

Uploaded by

Copyright:

Available Formats

CPM PERT

Class Link : https://youtu.be/l4P3dkih7Fg

❖ Area of Expertise: Civil Engineering AE & JE Exams

➢ Removal of Redundant Dummies

Such Dummies makes the Network Lengthy and Calculations

Rules of Removing Redundant Dummies:

A Rules of Removing Redundant

B Rules of Removing Redundant

A C Rules of Removing Redundant

2. An Event can not occur unless all preceeding activities are

3. An Event cannot occur Twice in a Network.

4. Number of arrows should be equal to number of

5. Time should always flow from left to right.

6. Length of arrow does not show any magnitude.

7. Arrows should normally not cross each other. if it is

8. No Activity can Start until its tail event has occured.

➢ Numbering Of Events (FULKERSON'S RULE)

It States “ Through Any Path From Initial Event to

➢ Numbering Of Events (FULKERSON'S RULE)

➢ Numbering Of Events (FULKERSON'S RULE)

Examples: Reasearch Work, Launching of Space

Examples: Construction Work, Maintainence Work,

1. Optimistic Time (t0) :This is the minnimum time in which an

2. Pessimistic Time (tp) : This is the maximum time in which an

3. Most Likely Time (tm) : This is the time required to complete an

➢ Expected Mean Time (te) :

• In PERT each activity is assumed to follow β-

➢ Expected Mean Time (te) :

• Time taken by variours activites follow β-Distribution.

te = (to + 4tm + tp)

➢ Standard Deviation Of An Activity (σ)

➢ Variance Of An Activity (σ2)

VARIANCE = (Standard Deviation)2

You might also like