The times required to complete each of eight jobs in a two-machine flow shop are shown in the table that follows. Each job must follow the same sequence, beginning with machine A and moving to machine B.

a. Determine a sequence that will minimize makespan time.

b. Construct a chart of the resulting sequence, and find machine B’s idle time.

c. For the sequence determined in part

a, how much would machine B’s idle time be reduced by splitting the last two jobs in half?
TIME (hours)
Job Machine A Machine B a 16 5 b 3 13 c 9 6 d 8 7 e 2 14 f 12 4 g 18 14 h 20 11 LO.1