Академический Документы
Профессиональный Документы
Культура Документы
3-1
3-3
3-6
Design house
and obtain
financing
3
2
Dummy
0
1
Order and
receive
materials
4
Select
paint
Build
house
3
1
Finish
work
Select
carpet
Build house
4
3
2
2
Start
Finish work
7
1
1
3
Design house
and obtain
financing
3
1
Order and receive
materials
3-7
5
1
Select paint
6
1
Select carpet
A
C
B
A
Dummy
C
D
3-8
Forward Pass
Earliest Start Time (ES)
earliest time an activity can start
ES = maximum EF of immediate predecessors
Earliest finish time (EF)
earliest time an activity can finish
earliest start time plus activity time
EF= ES + t
Backward Pass
Latest Start Time (LS)
CPM analysis
Draw the CPM network
Analyze the paths through the network
Determine the float for each activity
Compute the activitys float
float = LS - ES = LF - EF
Float is the maximum amount of time that this activity can be delay
in its completion before it becomes a critical activity, i.e., delays
completion of the project
Find the critical path is that the sequence of activities and events where
there is no slack i.e.. Zero slack
Longest path through a network
Find the project duration is minimum project completion time
3-10
PERT / CPM
Network planning methods that generate:
Relationship between activities
Project duration
Critical path
Slack for non critical activities
Crashing (cost / time trade-offs)
Resource usage
3-11
Immediate
Predecessor(s)
Description
A
B
B
A
C
D
A
E,G,H
F,I,J
A
B
B
A
C
D
A
E,G,H
F,I,J
Completion Time
I
Activity
Description
15
A
B
C
D
E
F
G
H
I
J
K
A
B
B
A
C
D
A
E,G,H
F,I,J
Path
A-I-K
36
A-F-K
31 Critical
Immediate
Completion Time
A-C-G-J-K
70 Path
I
Activity
Description
Predecessor(s)
B-D-H-J-K
72
15
B-E-J-K
46
A
Select administrative and medical
staff.
B
Select site
Critical Path
The longest path in the network
Defines the shortest time project can be completed
Critical path activity delay
project delay
3-16
ES
Activity
Name
EF
EF is earliest finish
EF = ES + Activity time
LS
3-17
Activity
Duration
LF
12
10
10
35
10
40
Start
E
24
3-18
Finish
Start
15
0 A 12
12 F 22
63 K 72
12
10
12 C 22
22 G 57
10
35
0 B 9
9 D 19
19 H 59
59 J 63
10
40
Critical
path
9 E 33
24
3-19
Finish
LS is latest start
ES
LS
LS = LF Activity time
3-20
Activity
Name
Activity
Duration
EF
LF
Start
A 12
12
14
Critical
path
0
0
B 9
9
12 I 27
48
63
15
12 F 22
53
63
63 K 72
63
72
10
12 C 22
14
24
22 G 57
24
59
9 D 19
9
19
19 H 59
19
59
10
Finish
35
40
10
9 E 33
35
59
24
3-21
59 J 63
59
63
What do you
notice about
ES/LS & EF/LF?
3-22
12
14
Slack = LF12 EF
12 I 27
48
63
15
12 F 22
53
63
63 K 72
63
72
10
12 C 22
14
24
22 G 57
24
59
9 D 19
9
19
19 H 59
19
59
Start
Slack
63 = 010
K = 63Critical
Finish
35
path
or
0
0
B 9
40
9 E 33
35
59
24
3-23
59 J 63
59
63
12 I 27
48Slack
63
0
2
A012 0
1214 14
129
9
9 35
12 53
22 24
Critical
19 19
path
12 48
B 9 59
59
63 9 63
2
0
12 F 22
53 2 63
10
0
26
41
12 C 22
14 2 24
10
0
36
0 19
9 D
9 0 19
Node Duration ES
Latest
start time
A
B
C
D
E
F
Start
G
H
I
J
K
12
9
10
10
24
10
35
40
15
4
6
0
2
0
0
15
22 G 57
24
59
Finish
35
19 H 59
19
59
40
10
59 J 63
59
63
Critical
24 path activities have zero slack
3-24
Activity Slack
How much would we like to reduce
the time for activity B?
Start
B 25
5 20 25
25
35
25 10 35
0
5
0 5 5
5
20
10 15 25
3-25
Finish
PERT
PERT is based on the assumption that an activitys duration follows a
probability distribution instead of being a single value
Three time estimates are required to compute the parameters of an
activitys duration distribution:
pessimistic time (tp ) - the time the activity would take if things did
not go well
most likely time (tm ) - the consensus best estimate of the activitys
duration
optimistic time (to ) - the time the activity would take if things did go
well
te =
tp + 4 tm + to
6
2
Variance: Vt
3-26
=2
tp - to
6
PERT analysis
Draw the network.
Analyze the paths through the network and find the critical path.
The length of the critical path is the mean of the project duration
probability distribution which is assumed to be normal
The standard deviation of the project duration probability distribution is
computed by adding the variances of the critical activities (all of the
activities that make up the critical path) and taking the square root of that
sum
Probability computations can now be made using the normal distribution
table.
3-27
Probability computation
Determine probability that project is completed within specified
time
x-
Z=
3-28
Probability
= tp
3-29
Time
PERT Example
Immed. Optimistic Most Likely Pessimistic
Activity Predec. Time (Hr.) Time (Hr.) Time (Hr.)
A
-4
6
8
B
-1
4.5
5
C
A
3
3
3
D
A
4
5
6
E
A
0.5
1
1.5
F
B,C
3
4
5
G
B,C
1
1.5
5
H
E,F
5
6
7
I
E,F
2
5
8
J
D,H
2.5
2.75
4.5
K
G,I
3
5
7
3-30
PERT Example
PERT Network
D
C
B
I
F
G
3-31
PERT Example
Activity
Expected Time
A
B
C
D
E
F
G
H
I
J
K
6
4
3
5
1
4
2
6
5
3
5
3-32
Variance
4/9
4/9
0
1/9
1/36
1/9
4/9
1/9
1
1/9
4/9
PERT Example
Activity ES
A
B
0
0
F
G
H
I
J
K
6
6 11
6
9
9
13
13
19
18
C
D
E
EF
LS
6
4
9
15
7
13
11
19
18
22
23
3-33
LF
0
5
6
20
12
9
16
14
13
20
18
Slack
6
9
9
9
13
13
18
20
18
23
23
0 *critical
5
0*
6
0*
7
1
0*
1
0*
PERT Example
Vpath = VA + VC + VF + VI + VK
= 4/9 + 0 + 1/9 + 1 + 4/9
= 2
path = 1.414
z = (24 - 23)/(24-23)/1.414 = .71
From the Standard Normal Distribution table:
P(z < .71) = .5 + .2612 = .7612
3-34
PROJECT COST
3-35
Project Crashing
Crashing
reducing project time by expending additional resources
3-37
Activity crashing
Crash
cost
Crashing
activity
Normal
cost
Normal
time
Crash
time
Activity time
3-38
Time-Cost Relationship
Time-Cost Tradeoff
Min total cost
= optimal
project time
Indirect
cost
Direct
cost
time
3-39
2
8
1
2
7
4
1
1
2
3
4
5
4
3-40
6
4
Normal
time
Normal
cost Rs
Crash
time
Crash
cost Rs
Allowable
crash time
slope
1
2
3
4
5
6
7
12
8
4
12
4
4
4
3000
2000
4000
50000
500
500
1500
7
5
3
9
1
1
3
2800
3500
6000
71000
1100
1100
21000
5
3
1
3
3
3
1
400
700
2000
8000
1100
1100
7000
75000
3-41
Project duration = 36
2
8
12
From..
7
4
1
12
3
4
6
4
5
4
2
8
To..
12
7
4
1
7
Project
duration = 31
Additional cost
= R2000
R400
3
4
3-42
5
4
6
4
GANTT CHART
3-43
Gantt Chart
Gantt Chart was developed by
Henry Laurence Gantt (1861-1919) was a
mechanical engineer and management consultant
who is most famous for developing the Gantt
chart in the 1910s. These Gantt charts were
employed on major infrastructure projects
including the Hoover Dam and Interstate highway
system. He refined production control and cost
control techniques.
3-44
Month
4
|
Activity
Design house
and obtain
financing
Lay
foundation
Order and
receive
materials
Build house
Select paint
Select carpet
Finish work
Month
3-45
10
Gantt Chart
Activities in Buy a House
`
BUY A HOUSE
LOCATION
FINANCING
FIND
HOUSE
- Criteria
- Determine
affordability
- Type of
House
- Visit
Locations
- Determine
mortgage
provider
- Find Real
Estate
Agent
- Lockup
mortgage
commitment
- Look for
House
- Make
Offer, P&S
Agreem't
10
3-46
- Closing
TASK
1-criteria
2-visit loc.
3-affordability
4-mortgage co
5-mortg lock
6-type of hse
7-real est agent
8-look for hse
9-offer, P&S
10-closing
PREDECESSOR
3
1
3
4
1
2, 6
7
5, 8
9