Project Management
Drawing networks
Activities on nodes (AoN) A B
Dummy activities In AoA, any 2 events in network can be directly connected to only one activity. Wrong:
w x 11 y 12 w
Right:
11
x
13
Dummy
12 y
Project Management
2
Dummy start
99 Dummy stop
J
K
12
11
Project Management
Drawing exercise 1
Activity A B C D E F G Predecessors A A B,C C D E,F
Drawing exercise 2
Activity A B C D E F G Predecessors A,B A,B C C,D F
Project Management
Scheduling calculations:
1. Forward pass Start each activity as early as possible. ES = Max. EF of immediate predecessors EF = ES + Task time
2. Backward pass Work backward from the project completion time in step 1, starting each activity as late as possible. LS = LF Task time LF = Min. LS of immediate successors
3. Compute slack times. Slack = LS ES or LF EF
Project Management 7
Description Edit script Casting Special effects Build sets Horror scenes Other scenes Previews Edit film
Task # 1 2 3 4 5 6 7 8
Days 2 1 2 2 3 1 1 2
1 1 3 2 5 5
4 4 6
Project Management
#7 (1 Day) Previews
#2 (1 day) Casting
Project Management
Time-cost tradeoffs
Activity direct costs Crash Activity fully expedited
Direct cost
Normal No expediting
Time
Project Management
10
Time
Project Management
11
Total cost
Project Management
12
1
70 8 80 50
9 30
4
5 90
7 150
Cost slope
5 3
3 **
4 200
** Activity 3-5 cannot be expedited The duration of each task is shown above the arrows. The cost slope for each task is shown below the arrows. The initial critical path is 0-1-2-4-5 @ 22 days. The initial cost is $3,050.
Project Management 13