(Answered) : (Job shop scheduling) Three jobs, J1,J2, and J3, are processed on 3 machines, M1, M2, and M3, according to the following sequences

(Job shop scheduling) Three jobs, J1,J2, and J3, are processed on 3 machines, M1, M2, and M3, according to the following sequences (processing times are show in parentheses): J1: M3(3)-M1(4)- M2(6) J2: M2(1) M3(5) – M2(9) J3: M3(8)- M2(8)- M1(7) The order in which the jobs are processed on the different machines is predetermined as M1:J1-J2-J3 M2: J2-J3-J1 M3: J3-J1-J2 Represent the problem as a CPM network for which the critical path determines the makespan of all three jobs. (a) (b) Use the critical path calculations to develop the scheduling of the jobs (Gantt chart), assuming that each operation is