Professional Documents
Culture Documents
Network Diagram:
Activity Predecessor Activity Predecessor
1 - 11 9
2 - 12 9
3 1,2 13 10
4 3 14 12
5 4 15 11,13
6 4 16 14,15
7 4 17 16
8 4 18 17
9 4,5
10 9
Now, calculate the expected time (TE), earliest start (ES), earliest finish (EF), latest start (LS),
latest finish (LF), and slack (SL) for each activity:
Activity
TE = (O + 4M + P) / 6
ES = earliest start time
EF = ES + TE
SL = slack = LS - ES
LS = latest start time
LF = LS + TE
# Activity TE ES EF LS LF SL
1. Research 5.00 0 5.00 0 5.00 0
2. Study 4.00 5 9.00 5 9.00 0
3. Define 4.00 5 9.00 5 9.00 0
4. Concept. 7.00 9 16.00 9 16.00 0
5. Feasibility 5.00 16 21.00 16 21.00 0
6. CAD 8.00 16 24.00 21 29.00 5
7. Stress 7.00 16 23.00 21 28.00 5
8. Optimize 6.00 16 22.00 23 29.00 7
9. Design 8.00 16 24.00 16 24.00 0
10. Consider 5.00 24 29.00 24 29.00 0
11. Adjust. 6.00 24 30.00 29 35.00 5
12. Damping 7.00 24 31.00 29 36.00 5
13. Safety 6.00 29 35.00 29 35.00 0
14. Assembly 8.00 31 39.00 36 44.00 5
15. Prototype 9.00 36 45.00 36 45.00 0
16. Iteration 7.00 45 52.00 45 52.00 0
17. Finalize 6.00 52 58.00 52 58.00 0
18. Document 5.00 58 63.00 58 63.00 0
The critical path is the longest path through the network and indicates the shortest time in which
the project can be completed. Activities on the critical path have zero slack.
In this example, the critical path is 1 -> 3 -> 4 -> 9 -> 10 -> 13 -> 15 -> 16 -> 17 -> 18 with a
total duration of 62 units of time.