The production manager must determine the processing sequence for a total of SEVEN jobs through two machines (M1 and M2) or departments. The same sequence will be allowed in both departments. The manager’s goal is to move the jobs through the two departments as quickly as possible. (a) Prepare a schedule using SPT for the first department i. e., M1. (1 point)

(b) With the help of a Gantt chart, calculate the total completion time, total idle time and the flowtimes of each job on M1 and M2 using this sequence. (2 points)

(c) Find the optimal sequence using Johnson’s Rule. (1 point)

(d) With the help of a Gantt chart, calculate the total completion time, total idle time and the flowtimes of each job on M1 and M2 using this optimal sequence. (2 points)
Note: You MUST draw a Gantt chart for both sequences in this problem.