2. In a job shop operation, four jobs may be performed on any of four machines. The hours required for each job on each machine are presented in the following table. The plant supervisor would like to assign jobs so that total time is minimized. Machines w 15 19 Y 21 Z 18 Job A12 A15 B2 17 14 18 12 20 17 17 16 B9 19 21 23 21 1. Formulate this problem using linear programing format. 2. Use QM for Windows to solve the program. 3. Explain the optimal solution. 2. In a job shop operation, four jobs may be performed on any of four machines. The hours required for each job on each machine are presented in the following table. The plant supervisor would like to assign jobs so that total time is minimized. Machines w 15 19 Y 21 Z 18 Job A12 A15 B2 17 14 18 12 20 17 17 16 B9 19 21 23 21 1. Formulate this problem using linear programing format. 2. Use QM for Windows to solve the program. 3. Explain the optimal solution