Spe 3 - ARCH. 542: Project Crashing
Spe 3 - ARCH. 542: Project Crashing
Spe 3 - ARCH. 542: Project Crashing
542
PROJECT CRASHING
20-Apr-18 1
Project Crashing and
Time-Cost Trade-Off Overview
20-Apr-18 2
The Project Network
House Building Project Data
Number Activity Predecessor Duration
1 Design house and obtain -- 12 months
financing
2 Lay foundation 1 8 months
20-Apr-18 6
Time-cost relationship for crashing activity 1
Project Crashing and Time-Cost Trade-Off
Example Problem
20-Apr-18 11
Project Crashing and Time-Cost Trade-Off
General Relationship of Time and Cost
20-Apr-18 12
The time-cost trade-off
Example
Sharon Lowe, Vice President for Marketing for the
Electronic Toys Company, is about to begin a
project to design an advertising campaign for a new
line of toys. She wants the project completed within
47 days in time to launch the advertising campaign
at the beginning of the Christmas season.
Sharon has identified the six activities (labeled A,
B, …, F) needed to execute this project.
Considering the order in which these activities need
to occur, she also has constructed the following
project network.
20-Apr-18 13
Example (Contd.)
A C E F
START F IN IS H
B D
20-Apr-18 14
Example (Contd.)
To meet the deadline of 47 days, Sharon has decided to
crash the project, using the CPM method of time-cost trade-
offs to determine how to do this in the most economical way.
She has gathered the data needed to apply this method, as
given below.
Time (days) Cost Maximum Crash
Activity Reduction in Cost per
Normal Crash Normal Crash Time day saved
20-Apr-18 15
Example - Solution
The upper path is A-C-E-F with a path length of 51 days.
Of the activities on the path, activity C has the smallest crash cost per
day saved ($10,000) and activity E is next ($15,000). Activity C can
only be reduced by 3 days, so activity E also will need to be crashed
somewhat. Therefore, we find that the most economical way of
reducing the length of this path to 47 days is to shorten activity C by 3
days and activity E by 1 day with an additional total cost of $45,000.
20-Apr-18 16
Example - Solution
The lower path is B-D with a path length of 50 days.
From the time-cost trade-off data, both activities B and D have a crash
cost per day saved of $10,000, and both can be reduced by more than 3
days. Therefore, using marginal cost analysis, we find that the most
economical way of reducing the length of this path to 47 days is to
shorten either activity (it doesn’t matter which one) by 3 days with an
additional total cost of $30,000.
Activity to crash Crash Cost Length of Path
B-D
50
B or D $10,000 49
B or D $10,000 48
B or D $10,000 47
20-Apr-18 17
Example - Solution
20-Apr-18 18