Scribd
Upload
33 views15 pages

Ch08'-Scheduling - Review and Homework

The document discusses scheduling techniques for construction projects including the critical path method and PERT analysis. It provides examples and assignments for developing network diagrams, identifying critical paths and slack times, and calculating project completion times using the PERT method.

Uploaded by

bobby510
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
33 views15 pages

Ch08'-Scheduling - Review and Homework

The document discusses scheduling techniques for construction projects including the critical path method and PERT analysis. It provides examples and assignments for developing network diagrams, identifying critical paths and slack times, and calculating project completion times using the PERT method.

Uploaded by

bobby510
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/ 15

CHAPTER 8

SCHEDULING
Review & Homework
Review: Construction the Network AON-AOA
Practice 1: Construction the Network AON-AOA
Assignment 1: Construction the Network AON-AOA
Assigment 2

1. Develop a network diagram for this problem


2. What is the critical path?
3. What is the slack time for each individual activity?

8-5
Assignment 3
ACTIVITY IMMEDIATE TIME (DAYS)
PREDECESSOR(S)
A _ 3
B A 4
C A 6
D B 6
E B 4
F C 4
G D 6
H E,F 8

1. Develop a network diagram for this problem


2. What is the critical path?
3. Determine the slack on all activities.
Review: Slack/Float Identification

Earliest Earliest
Start
ES Activity EF Finish

Latest Start LS Duration LF Latest Finish

8-7
What the Critical Path Calculates
 Earliest Start (ES) = the earliest time at which an activity can start
 Calculated by a forward pass through the network diagram,
 Calculated on the basis of the project’s start time and the duration the
preceding activity. If If an activity has multiple immediate predecessors:
ES= Max {EF of all immediate predecessors}
 Earliest Finish (EF) = the earliest time by which an activity can be finished
 Calculated by adding the activity’s duration estimate to the earliest start
time.
EF= ES + Duration estimate

8-8
What the Critical Path Calculates
 Latest Finish (LF) = the latest time at which an activity has to finish and still allow
the project to be completed on time.
 Calculated by a backward pass through the network diagram
 Calculated on the basis of the project’s completion time and the duration for the
succeeding activities. If an activity is an immediate predecessor to more than one
activity
LF = Min {LS of all immediate following activities}
 Latest Start (LS) = the latest time by which an activity can start and still allow the
project to be completed on time.
 Calculated by subtracting the activity’s duration from the activity’s latest finish time
LS= LF – Duration estimate

8-9
Assignment 4

1. Develop a network diagram for this problem


2. What is the critical path?
3. What is the slack time for each individual activity?
8-10
Calculating Uncertain Activity Times:
PERT Method

𝟐
𝟐

8-11
Calculating Uncertain Activity Times:
PERT Method

Assignment 5:

8-12
Calculating Uncertaint Activity Times:
PERT Method

Assignment 6:

(d) What is the probability completion time of this


project?

8-13
Calculating PERT Method
Assignment 7:

8-14
Questions?

8-15

You might also like