Construction Technology
and Management
Dr. Abhishek Jindal
 Slack
 Critical Path
 Practice Problem
 Probability of Meeting Scheduled date
Overview
 Earliest Expected time (TE)
 Latest Allowable Occurrence time (TL)
 Difference between latest allowable time and the earliest expected
time of an event - SLACK
S = TL - TE
 Slack gives idea of time to spare.
SLACK
SLACK
SLACK
Slack could be Positive, Negative or
Zero depending upon the relationship
between TE and TL.
Positive Slack - when TL is more than
TE for an event. Indicates Ahead of
Schedule condition.
Zero Slack - when TL is equal to TE for
for an event. Indicates On Schedule
condition.
Negative Slack - when TL is less than
TE for an event. Indicates Behind of
Schedule condition.
SLACK
 For an event - value of slack determines - how critical the event is.
 Less the slack time (even negative) - more critical an event is.
 A critical path is the one which connects the events having zero or
minimum slack times.
 Any delay in occurrence of events on critical path will result in the
delay in scheduled completion of project.
 Eventually, a critical path is the longest path (time wise) connecting the
initial and final event. CRITICAL
PATH
Determine the Critical Path for above network.
PRACTICE
PROBLEM
 Earliest expected time and Latest allowable occurrence time for each
event is already shown in network.
 Calculating Slack for each event by taking difference between Earliest
expected time and Latest allowable occurrence time for each event.
PRACTICE
PROBLEM
PRACTICE
PROBLEM
PRACTICE
PROBLEM
Determine the Critical Path for above network.
PRACTICE
PROBLEM
PRACTICE
PROBLEM
PRACTICE
PROBLEM
Determine the Critical Path for above network. Given
scheduled completion time is 21 days
 Latest Allowable Occurrence time - scheduled completion time
 Critical path
 What is the probability of meeting the scheduled time?
 Procedure for determining the probability of meeting the scheduled
time:
 Step 1: Determine standard deviation (σ) for critical path for network.
σ = (Sum of variances along critical path)1/2
σ = √ (Σ σ2)
Variance for an activity ij is given by
σ2
ij = (
tij
p − tijo
6
)2
 Step 2: Calculating Probability factor
Z =
𝑇𝑆
−𝑇𝐸
σ
=
𝑇𝑆 −𝑇𝐸
√ (Σ σ2)
PROBABILITY
OF MEETING
SCHEDULED
DATE
 Probability Factor (Z) can be positive, zero or negative.
 When Z is positive, chances of completing project on time are more than
50%.
 When Z is Zero, chances of completing project on time are fifty-fifty.
 When Z is negative, chances of completing project on time are less than
50%.
 Step 3: Find % Probability with respect to Z from table. PROBABILITY
OF MEETING
SCHEDULED
DATE
PROBABILITY
OF MEETING
SCHEDULED
DATE
PROBABILITY
OF MEETING
SCHEDULED
DATE
PROBABILITY
OF MEETING
SCHEDULED
DATE
PROBABILITY
OF MEETING
SCHEDULED
DATE
PROBABILITY
OF MEETING
SCHEDULED
DATE
PROBABILITY
OF MEETING
SCHEDULED
DATE
PROBABILITY
OF MEETING
SCHEDULED
DATE
END

CTM - 07 - PERT - Network Analysis.pptx

  • 1.
  • 2.
     Slack  CriticalPath  Practice Problem  Probability of Meeting Scheduled date Overview
  • 3.
     Earliest Expectedtime (TE)  Latest Allowable Occurrence time (TL)  Difference between latest allowable time and the earliest expected time of an event - SLACK S = TL - TE  Slack gives idea of time to spare. SLACK
  • 4.
  • 5.
    SLACK Slack could bePositive, Negative or Zero depending upon the relationship between TE and TL. Positive Slack - when TL is more than TE for an event. Indicates Ahead of Schedule condition. Zero Slack - when TL is equal to TE for for an event. Indicates On Schedule condition. Negative Slack - when TL is less than TE for an event. Indicates Behind of Schedule condition.
  • 6.
  • 7.
     For anevent - value of slack determines - how critical the event is.  Less the slack time (even negative) - more critical an event is.  A critical path is the one which connects the events having zero or minimum slack times.  Any delay in occurrence of events on critical path will result in the delay in scheduled completion of project.  Eventually, a critical path is the longest path (time wise) connecting the initial and final event. CRITICAL PATH
  • 8.
    Determine the CriticalPath for above network. PRACTICE PROBLEM
  • 9.
     Earliest expectedtime and Latest allowable occurrence time for each event is already shown in network.  Calculating Slack for each event by taking difference between Earliest expected time and Latest allowable occurrence time for each event. PRACTICE PROBLEM
  • 10.
  • 11.
  • 12.
  • 13.
  • 14.
    PRACTICE PROBLEM Determine the CriticalPath for above network. Given scheduled completion time is 21 days
  • 15.
     Latest AllowableOccurrence time - scheduled completion time  Critical path  What is the probability of meeting the scheduled time?  Procedure for determining the probability of meeting the scheduled time:  Step 1: Determine standard deviation (σ) for critical path for network. σ = (Sum of variances along critical path)1/2 σ = √ (Σ σ2) Variance for an activity ij is given by σ2 ij = ( tij p − tijo 6 )2  Step 2: Calculating Probability factor Z = 𝑇𝑆 −𝑇𝐸 σ = 𝑇𝑆 −𝑇𝐸 √ (Σ σ2) PROBABILITY OF MEETING SCHEDULED DATE
  • 16.
     Probability Factor(Z) can be positive, zero or negative.  When Z is positive, chances of completing project on time are more than 50%.  When Z is Zero, chances of completing project on time are fifty-fifty.  When Z is negative, chances of completing project on time are less than 50%.  Step 3: Find % Probability with respect to Z from table. PROBABILITY OF MEETING SCHEDULED DATE
  • 17.
  • 18.
  • 19.
  • 20.
  • 21.
  • 22.
  • 23.
  • 24.