Professional Documents
Culture Documents
Chapter 8
■ Objectives
■ Project Scope
■ Contract Requirements
■ Schedules
■ Resources
■ Personnel
■ Control
■ Risk and Problem Analysis
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-5
Elements of Project Management
The Project Team
■ Project team typically consists of a group of individuals from various
areas in an organization and often includes outside consultants.
■ Members of engineering staff often assigned to project work.
■ Project team may include workers.
■ Most important member of project team is the project manager.
■ Project manager is often under great pressure because of uncertainty
inherent in project activities and possibility of failure. Potential
rewards, however, can be substantial.
■ Project manager must be able to coordinate various skills of team
members into a single focused effort.
■ Modules are further broken down into activities and, finally, into
individual tasks.
2. Lay foundation 1 2
3. Order Materials 1 1
4. Build house 2, 3 3
5. Select paint 2, 3 1
6. Select carpet 5 1
7. Finish work 4, 6 1
Figure 8.6
Expanded Network for Building a
House Showing Concurrent Activities
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-20
The Project Network
AON Network for House Building Project
Activity-on-Node (AON) Network
▪ A node represents an activity, with its label and time shown on the node
▪ The branches show the precedence relationships
▪ Convention used in Microsoft Project software
Figure 8.8
Path Events
A 1→2→4→7
B 1→2→5→6→7
C 1→3→4→7
D 1→3→5→6→7
Table 8.1
Paths Through the House-Building Network
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-22
The Project Network
The Critical Path
The critical path is the longest path through the network; the
minimum time the network can be completed. From Figure 8.8:
Path A: 1 → 2 → 4 → 7 3 + 2 + 3 + 1 = 9 months
Path B: 1 → 2 → 5 → 6 → 7 3 + 2 + 1 + 1 + 1= 8 months
Path C: 1 → 3 → 4 → 7 3 + 1 + 3 + 1 = 8 months
Path D: 1 → 3 → 5 → 6 → 7 3 + 1 + 1 + 1 + 1 = 7 months
*2 3 3 5 5 0
3 4 3 5 4 1
*4 5 5 8 8 0
5 6 5 7 6 1
6 7 6 8 7 1
*7 8 8 9 9 0 *Critical path
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-28
The Project Network
Activity Slack Time (2 of 2)
= 25 weeks
2 = 62/9
= 6.9 (weeks)2
Exhibit 8.2
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-42
Analysis with Microsoft Project (1 of 13)
Exhibit 8.3
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-43
Analysis with Microsoft Project (2 of 13)
Exhibit 8.4
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-44
Analysis with Microsoft Project (3 of 13)
Exhibit 8.5
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-45
Analysis with Microsoft Project (4 of 13)
Exhibit 8.6
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-46
Analysis with Microsoft Project (5 of 13)
Figure 8.7
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-47
Analysis with Microsoft Project (6 of 13)
Figure 8.8
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-48
Analysis with Microsoft Project (7 of 13)
Exhibit 8.9
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-49
Analysis with Microsoft Project (8 of 13)
Exhibit 8.10
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-50
Analysis with Microsoft Project (9 of 13)
Exhibit 8.11
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-51
Analysis with Microsoft Project (10 of 13)
Exhibit 8.14
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-54
Analysis with Microsoft Project (13 of 13)
Exhibit 8.15
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-55
Project Crashing and
Time-Cost Trade-Off Overview
■ Project duration can be reduced by assigning more resources to
project activities.
Figure 8.20
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-58
Project Crashing and Time-Cost Trade-Off
Example Problem (3 of 5)
Table 8.4
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-59
Project Crashing and Time-Cost Trade-Off
Example Problem (4 of 5)
Figure 8.21 Network with Normal Activity Times and Weekly Crashing Costs
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-60
Project Crashing and Time-Cost Trade-Off
Example Problem (4 of 5)
Figure 8.21 Network with Normal Activity Times and Weekly Crashing Costs
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-61
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-62
Project Crashing and Time-Cost Trade-Off
Example Problem (5 of 5)
As activities are crashed, the critical path may change and
several paths may become critical.
Figure 8.22
Revised Network with
Activity 1 Crashed
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-63
Project Crashing and Time-Cost Trade-Off
Project Crashing with QM for Windows
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Exhibit 8.16 8-64
Project Crashing and Time-Cost Trade-Off
General Relationship of Time and Cost (1 of 2)
Figure 8.23
The Time-Cost Trade-Off
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-66
The CPM/PERT Network
Formulating as a Linear Programming Model
The objective is to minimize the project duration (critical path time).
Where:
xi = earliest event time of node i
xj = earliest event time of node j
tij = time of activity i → j
Figure 8.24
Minimize Z = x1 + x2 + x3 + x4 + x5 + x6 + x7
subject to:
x2 - x1 12
x3 - x2 8
x4 - x2 4
x4 - x3 0
x5 - x4 4
x6 - x4 12
x6 - x5 4
x7 - x6 4
xi, xj 0
B6:B12
Exhibit 8.17
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-70
The CPM/PERT Network
Example Problem Solution with Excel (2 of 4)
Exhibit 8.18
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-71
The CPM/PERT Network
Example Problem Solution with Excel (3 of 4)
Exhibit 8.19
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-72
The CPM/PERT Network
Example Problem Solution with Excel (4 of 4)
Exhibit 8.20
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-73
Project Crashing with Linear Programming
Example Problem – Model Formulation
Minimize Z = $400y12 + 500y23 + 3000y24 + 200y45 + 7000y46
+ 200y56 + 7000y67
subject to:
y12 5 y12 + x2 - x1 12 x7 30
y23 3 y23 + x3 - x2 8 xi, yij ≥ 0
y24 1 y24 + x4 - x2 4 Objective is to
y34 0 y34 + x4 - x3 0 minimize the
y45 3 y45 + x5 - x4 4
cost of crashing
y46 3 y46 + x6 - x4 12
y56 3 y56 + x6 - x5 4
y67 1 x67 + x7 - x6 4
xi = earliest event time of node I
xj = earliest event time of node j
yij = amount of time by which activity i → j is crashed
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-74
Project Crashing with Linear Programming
Excel Solution (1 of 3)
Exhibit 8.21
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-75
Project Crashing with Linear Programming
Excel Solution (2 of 3)
Exhibit 8.22
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-76
Project Crashing with Linear Programming
Excel Solution (3 of 3)
Exhibit 8.23
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 8-77
Example Problem
Problem Statement and Data (1 of 2)
Given this network and the data on the following slide, determine the
expected project completion time and variance, and the probability
that the project will be completed in 28 days or less.
t = a + 4m + b v= b-a
6
6
Step 2: Determine the earliest and latest activity times & slacks