Project Scheduling and
Crashing
Recall the four stages
 Project
Conceptualization and
Definition
 Project Planning and Budgeting
 Project Execution
 Project Monitoring and Control
 Project Termination and Closeout
Recall the four core
knowledge areas
Recall the four facilitating
knowledge areas
Recall the four project
player types
Recall five processes
within the scope
knowledge area
1.
 2.
 3.
 4.
 5.
 6.

Plan Scope Management
Collect Requirements
Define Scope
Create WBS
Validate Scope
Control Scope
Time Management
Knowledge Area - Processes
Plan
Schedule Management
Define Activities
Sequence Activities
Estimate Activity Durations
Develop Schedule
Control Schedule
Activity Definition
 Decomposition
–top down….
–What has to happen in order to
create a WBS
 Composition
from the bottom up
 Use of a template
–A list from a previous project that is
similar










Consider the 2004
Construction Estimator
Excavation
Foundation
Flatwork
Brick hearth & veneer
Rough hardware
Finish hardware
Rough lumber
Finish lumber
Rough carpentry labor
Finish carpentry labor








Rough carpentry labor
Finish carpentry labor
Countertops
Cabinets
Insulation
Roofing
Painting
Shower & tub
Interview
CIO
Activity Sequencing
Interview
Manager A
Interview
Manager B
Compile
interview data
and analyze
Interview
Manager C
Prepare
report
Interview
Manager D
Prepare and
deliver
presentation
Sequence Relationships
Finish/Start
Start/Start
Finish/Finish
Start/Finish
Project Networks
Activity
on node
–Most popular
Activity
on arrow
–Not used
From project networks,
we determine
 The
project duration
 The critical path
 Tasks on the critical path
 Tasks not on the critical path
 Slack associated with non-critical
tasks
 Earliest start, earliest finish, latest
start and latest finish times
Tabular format
NAME
DURATION
PREDECESSORS
A
5
B
10
C
5
A, B
D
20
A, B
E
5
C
F
10
D, E
The AON Network
A/5
B/10
C/5
E/5
D/20
F/10
The AOA Network
Start and Finish Dates
ES
EF
N/K
LS
LF
Notation






ES – earliest start for the node, assumed to be
at the beginning of the day
EF – earliest finish for the node, assumed to be
at the end of the day
LS – latest start for the node, assumed to be at
the beginning of the day
LF – latest finish for the node, assumed to be at
the end of the day
N -- the label of the node (task, step, activity)
K -- the duration of the node ( number
following the slash)
Start and Finish Dates
ES
LS
N/K
EF
LF
Precedence Relations
With
FS (FINISH/START)
relationships, a successor
activity does not start until all
of its predecessors are
Example 1
A/6
B/7
C/8
D/10
Example 2
A/6
B/7
C/8
D/10
Example 3