Problem $16-10($Static$)$

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$.$

TIME $($hours$)$

Job Machine A Machine B

a $165$

b $313$

c $96$

d $87$

e $214$

f $124$

g $1814$

h $2011$

Click here for the Excel Data File

a$.$ Determine a sequence that will minimize makespan time.

b$.$ Find machine B$$s idle time.

c$.$ For the sequence determined in part a$,$ how much would machine B$\text{'}$s idle time be reduced by splitting the last two jobs in half?