A project has the nine tasks T1, T2, T3, T4, T5, T6, T7, T3, and T9. Task T1 takes i days to complete tor i = 1, 2, ... , 9. If i divides j and i ≠ J, then task Tj cannot be started until task Ti is completed.
(a) Make a PERT diagram for this project. Include the task symbols T1, T2, … , T9 and the times in each circle.
(b) Apply the PERT method to assign to each task the shortest time until it can be completed. What is the shortest time to complete the whole project?
(c) What is the critical path?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.