Table J.12 Consider the Following Problems in Which Six Jobs Must Each

Multiple Choice

Table J.12
Consider the following problems in which six jobs must each be processed on two machines starting with machine 1 and then going to machine 2.The following processing times and due dates are in hours.

-Use the information in Table J.12.What sequence would you use if you wanted to minimize the makespan of the jobs?

A) A-C-E-B-D-F
B) B-F-D-E-C-A
C) C-F-A-E-B-D
D) C-D-B-A-F-E