Homework: Scheduling $($i

Soved

Help

Save & Exit

Submit

Check my work

$2$

$3$

$5$

points

Skipped

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

$\backslash$table$[[,$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]]$

Click here for the Excel Data File

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

The sequence is $$

b$.$ Find machine B$\text{'}$s idle time.

Idle time hours

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?

New idle time

hours, savings of

hours.