Question

Consider the following problems in which four jobs must each be processed on two machines starting with Machine A and then going to Machine B. The following processing times are available (in hours):


Job Processing Time Machine A Processing Time Machine B
A 1 5
B 8 2
C 3 9
D 7 7

What is the minimum makespan for this group of jobs? Depict it graphically using a Gantt chart.

Answer

This answer is hidden. It contains 147 characters.