Job Shop Scheduling. Consider a job shop where $3$ types of parts are processed in $3$

machines. The order of operations and processing times are given in the following table.

a$)$ Use the non$-$delay schedule generation algorithm from class to generate a non$-$delay

schedule for these operations. Break any ties by choosing the operation with the Shortest

Processing Time $($SPT$).$