Ch 8 homework

Download Document
Showing pages : 1 of 1
This preview has blurred sections. Sign up to view the full version! View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Chapter 8 number 6 homework problem EST LST Label Time EFT LFT 0 0 Slack = Start 0 0 0 Duration of Project is: 30 months Shortest Critical Path: 1, 4, 10 Label/Activity 1 2 3 4 5 6 7 8 9 10 11 12 Time 8 10 9 4 6 5 7 15 12 18 4 7 0 0 Slack = 1 8 0 0 0 Slack = 2 10 0 10 10 0 6 Slack = Pred 1 1 2 3 3, 5, 6 3, 5, 6 4 7, 9 8, 11 LATEST TIME IS THE MAXIMUN OF THE PREDECESSOR 8 8 Slack = 8 8 3 9 6 9 15 10 10 Slack = 6 5 0 15 15 4 4 0 12 12 8 9 Slack = 5 6 1 14 15 9 20 Slack = 7 7 11 16 27 15 16 Slack = 15 15 Slack = 9 12 0 27 27 8 15 1 12 12 Slack = 30 31 27 27 Slack = 11 4 0 31 31 10 18 0 30 30 31 31 Slack = 12 7 0 38 38 ...
View Full Document