In a job shop operations, 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.
Job w x y z
A 10 14 16 13
B 12 13 15 12
C 9 12 12 11
D 14 16 18 16
A. Find the best solution (by formulating it as an LP problem or any other method). Which assignments should be made? What cost?
B. Formulate this problem as a linear program.
Job A should be assigned to machine Z Job B should be... View the full answer