Documente Academic
Documente Profesional
Documente Cultură
Graphically displays project activities Estimates how long the project will take Indicates most critical activities Show where delays will not affect project
Developed in 1950s CPM by DuPont for chemical plants PERT by U.S. Navy for Polaris missile
17-3
maintenance
Project Management
Slack is the amount of time an activity can be delayed without delaying the project
17-4
Project Management
Path
Sequence of activities that leads from the starting node to the finishing node The longest path; determines expected project duration Activities on the critical path
Critical path
Critical activities
Slack
Allowable slippage for path; the difference the length of path and the length of critical path
17-5
Project Management
4
Furniture setup
2
Remodel
1
Interview
5
Move in Hire and train
17-6
Project Management
Furniture setup
AON
1
Remodel
6
Move in
S
Hire and train
Interview
17-7
Project Management
Network Conventions
a c b a b c
a a c b b d
c Dummy activity
17-8
Project Management
Time Estimates
Deterministic
Probabilistic
17-9
Project Management
6 weeks
4 2
11 weeks
3 weeks
1
4 weeks 9 weeks
Move in
1 week
2)
3)
6 weeks
4 2
11 weeks
3 weeks
1
4 weeks 9 weeks
Move in
1 week
Example 1 Solution
Critical Path
Length
(weeks)
Slack 2 0 6
18 20 14
Computing Algorithm
Network activities
ES: early start (As soon as you can start the activity) EF: early finish (As soon you can finish the activity) LS: late start ( For back calculations) LF: late finish ( For back calculations) Expected project duration Slack time Critical path
Used to determine
duration ES 8 0 4 0 6 8 11 8 9 4 3 14 1 19
EF 8 4 14 19 13 17 20
LF 8 10 16 19 19 19 20
LS LS-ES 0 0 6 6 10 2 8 0 10 6 16 2 19 0
CPM
Picnic program
DEFINE ACTIVITIES
2)
3)
Without precedence
Picnic program
Activities A B C PREPARE TEA PREPARE FRUITS PREPARE SANDWICHES Time in min 20 5 10
D
E F G H
PREPARE BASKET
DRESS UP COLECT BLANKETS PREPARE SUIT CASE LOAD CAR
10
15 5 20 10
I
J
GET GAS
GET SPARES
10
15
DRIVE
30
HOW TO ARRANGE IT
6 2 8 7
1
3 10
4
5
Picnic program
Activities A B 1,3 PREPARE TEA 1,2 PREPARE FRUITS Time in min 20 5
C
D E F
10
10 15 5
G
H I J K
20
10 10 15 30
NODE DIAGRAM
`A
20
10
15
10
10
15
30
10
5B
2
10 C
5F
5
20 G
NODE DIAGRAM
10
CPM
A
B C D E
1-3
FOUNDATION
2
1 1 3 2
1-2 BRICKS COLLECTION 2-3 CEMENT COLLECTION 3-4 FIRST DPC 4-6 CURING
F
G H I J K L M N O P Q R S
1
1 2 2 1 1 5 1 21 5 15 2 15 2
NODE DIAGRAM
10
15
11
13
14
16
12
PERT
Optimistic time
Pessimistic time
Probabilistic Estimates
tm
te
tp Pessimistic time
Expected Time
te
t + 4t +t o m p = 6
te = expected time to = optimistic time tm = most likely time tp = pessimistic time
Variance
2 (t t ) = p o 36
Example
Most likely time Pessimistic time
Optimistic time
2-4-6 b
3-4-5 d 3-5-7 e 4-6-8 h 5-7-9 f
Path Probabilities
Z = Specified time Path mean Path standard deviation
Z indicates how many standard deviations of the path distribution the specified time is beyond the expected path duration.
g-h-i
13.5 Weeks
Crash the project one period at a time Only an activity on the critical path Crash the least expensive activity Multiple critical paths: find the sum of crashing the least expensive activity on each critical path
Advantages of PERT
Limitations of PERT
Important activities may be omitted Precedence relationships may not be 4 correct 2 Estimates may include a fudge factor 1 May focus solely on critical path
3
142 weeks 5 6