Академический Документы
Профессиональный Документы
Культура Документы
Project Management
Learning Objectives
After completing this chapter, students will be able to:
𝑏−𝑎 2
𝑉𝑎𝑟 = ( )
6
Finding the Critical Path (CP)
The CP is the longest time path route through the network. Any delay of
activity on the CP will delay the project’s completion time
Earliest Time Calculation: Forward Pass method Latest Time Calculation: Backward Pass method
EF = ES + t LS = LF - t
ES = Largest EF of Immediate Predecessors LF = Smallest LS of following activities
Concept of Slack
Slack: length of time an activity can be delayed without delaying the whole project
Slack = LS – ES or LF – EF
• B and D has slack = 1 can
SLACK =
be delayed up to 1 week
ES EF LS LF LS - ES CP ?
without delaying the whole
A 0 2 0 2 0 Yes
project
B 0 3 1 4 1 No
C 2 4 2 4 0 Yes
• F has slack = 6 can be
D 3 7 4 8 1 No
delayed up to 6 weeks
E 4 8 4 8 0 Yes
F 4 7 10 13 6 No
G 8 13 8 13 0 Yes • Activity A, C, E, G, H: 0 slack
H 13 15 13 15 0 Yes time Critical Activities
Probability of Project Completion
A Project Manager
can choose any
budget plan between
two plans
Monitoring and Controlling Project Costs
Ensure the project’s progress is on schedule and cost
overruns are kept to a minimum level
3. Select activity on CP with the smallest crash cost per week. Crash this
activity to the maximum extent possible or to the point at which desired
deadline has been reached