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.
|Job||Machine A||Machine B|
|a.||Determine a sequence that will minimize makespan time.|
|The sequence is .|
|b.||Find machine Bâ€™s idle time.|
|Idle time||[removed] hrs|
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?
|New idle time [removed] hrs, savings of [removed] hrs.|