Chapter 8
Objectives
Project scope
Contract requirements
Schedules
Resources
Personnel
Control
Risk and problem analysis
Copyright 2016 Pearson Education, Ltd. 8-5
The Project Management Process
Modules are further broken down into activities and, finally, into
individual tasks.
Path Events
A 1247
B 12567
C 1347
D 13567
Table 8.1
Paths through the house-building network
Copyright 2016 Pearson Education, Ltd. 8-23
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
= 25 weeks
2 = 62/9
= 6.9 weeks2
Figure 8.17 Probability that the network will be completed in 30 weeks or less
Copyright 2016 Pearson Education, Ltd. 8-38
Probability Analysis of a Project Network
Example 1 (2 of 2)
What is the probability that the new order processing
system will be ready by 30 weeks?
25weeks
2 6.9
6.9 2.63
x Z value of 1.90 corresponds to
Z probability of .4713 in Table A.1,
Appendix A. The probability of
30 25 completing project in 30 weeks or less:
Z 1.90 (.5000 + .4713) = .9713.
2.63
Copyright 2016 Pearson Education, Ltd. 8-39
Probability Analysis of a Project Network
Example 2 (1 of 2)
Exhibit 8.3
Copyright 2016 Pearson Education, Ltd. 8-44
Analysis with Microsoft Project (2 of 6)
Exhibit 8.4
Copyright 2016 Pearson Education, Ltd. 8-45
Analysis with Microsoft Project (3 of 6)
Critical activities
highlighted in red
Exhibit 8.5
Copyright 2016 Pearson Education, Ltd. 8-46
Analysis with Microsoft Project (4 of 6)
Click to get
Click Zoom to make network
network
larger or smaller on screen
Exhibit 8.6
Copyright 2016 Pearson Education, Ltd. 8-47
Analysis with Microsoft Project (5 of 6)
Exhibit 8.7
Copyright 2016 Pearson Education, Ltd. 8-48
Analysis with Microsoft Project (6 of 6)
Table 8.4 Normal activity and crash data for the Fig 8.19 network
Figure 8.21 Network with normal activity times and weekly crashing costs
Copyright 2016 Pearson Education, Ltd. 8-54
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.
minimize Z xi
General linear i
programming model subject to
with AOA convention
x j xi tij , for all activities i j
xi , x j 0
where
xi earliest event time of node i
x j earliest event time of node j
tij time of activity i j
Copyright 2016 Pearson Education, Ltd. 8-59
The CPM/PERT Network
Example Problem Formulation and Data (1 of 2)
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 =B7-B6
Decision variables,
B6:B12 Exhibit 8.10
Exhibit 8.12
Exhibit 8.14
Exhibit 8.15
Copyright 2016 Pearson Education, Ltd. 8-68
Project Crashing with Linear Programming
Excel Solution (3 of 3)
Exhibit 8.16
Copyright 2016 Pearson Education, Ltd. 8-69
Example Problem (1 of 6)
Given this AON 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
6
2
v b
- a
6
Step 2: Determine the earliest and latest activity times & slacks