Dokumen - Tips - Project Scheduling Networks Duration Estimation and Critical Path 569534ee0f974
Dokumen - Tips - Project Scheduling Networks Duration Estimation and Critical Path 569534ee0f974
Duration Estimation,
and Critical Path
Chapter 9
[email protected]
Project Scheduling Terms
• Successors
• Predecessors
• Network diagram
• Serial activities
• Concurrent activities
A D E F
C
[email protected]
Project Scheduling Terms
• Merge activities
• Burst activities
• Node
• Path
• Critical Path
A D E F
C
[email protected]
Network Diagrams
Show Help
interdependence schedule
resources
Show
Facilitate start &
communication finish
dates
Determine project Identify
completion critical
activities
[email protected]
AOA Vs. AON
The same mini-project is shown with activities on
arc…
D E
B F
C
C
[email protected]
Node Labels
Early ID Early
Start Number Finish
Activity
Float Activity Descriptor
Late Activity Late
Start Duration Finish
[email protected]
Duration Estimation Methods
• Past experience
• Expert opinion
• Mathematical derivation – Beta distribution
– Most likely (m)
2
– Most pessimistic (b) ba
– Most optimistic (a)
Activity Variance = s
2
6
a 4m b
Activity Duration = TE
6
[email protected]
1. Sketch the network described in the table.
2. Determine the expected duration and variance of each
activity.
Task Predecessor a b c
Z -- 7 8 15
Y Z 13 16 19
X Z 14 18 22
W Y, X 12 14 16
V W 1 4 13
T W 6 10 14
S T, V 11 14 19
[email protected]
Constructing the Critical Path
• Forward pass – an additive move through the
network from start to finish
[email protected]
Rules for Forward/Backward Pass
Forward Pass Rules (ES & EF)
– ES + Duration = EF
– EF of predecessor = ES of successor
– Largest preceding EF at a merge point becomes EF
for successor
[email protected]
Laddering Activities
Project ABC can be completed more efficiently if
subtasks are used
A(3) B(6) C(9) ABC=18 days