A shoe repair operation uses a two$-$step sequence that all jobs in a certain category follow. All jobs can be split in half at both stations. For the group of jobs listed:

$\backslash$table$[[,$JOB TIMES $($minutes$)],[,$A$,$B$,$C$,$D$,$E$],[$Workstation A$,27,18,70,26,15],[$Workstation B$,45,33,30,24,10]]$

Click here for the Excel Data File

a$.$ Find the sequence that will minimize total completion time.

The sequence is

B$-$A$-$C$-$D$-$E

b$.$ Determine the amount of idle time for workstation B$.$

minutes