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 inhalf?

Transcribed Image Text:

TIME (hours) Job Machine A Machine B 16 13 14 12 18 20 14