Draw a Gantt chart for the tasks shown in Problem and Exercise 3-47.

 

Problem and Exercise 3-47.

Assume you have a project with ten activities labeled A–J, as shown. Derive the earliest completion time (or early finish—EF), latest completion time (or late finish—LF), and slack for each of the following tasks (begin at time = 0). Which tasks are on the critical path? Highlight the critical path on your network diagram.

Preceding Event Expected Duration Critical EF LF Slack Path? Activity A A A D A E A, D 6 F , G D, E H E 3 F, G H, I 45o7 o542 45