Activity Immediate Predecessor Time (days)
A - 3
B - 7
C A 4
D B 2
E- C,D 5
F - A 6
G - E,F 3
The following are activity times for the project. Find the earliest, latest, and slack times for each activity. Then Find the critical path.
Maximum number of days that the entire project is completed: 17 days
The solution provides a step-by-step guide in solving a PERT/CPM problem. The network diagrams are in the MS Word file.