The following table contains order$-$dependent setup times for three jobs.

$\backslash$table$[[,,$Setup Time $($hours$),$Following Job's Setup Time $($hours$)],[,$A$,$B$,$C$],[,$A$,2\mathrm{.}4,-,1\mathrm{.}8,2\mathrm{.}2],[$Preceding Job,B$,3\mathrm{.}2,0\mathrm{.}8,-,1\mathrm{.}4],[,$C$,2\mathrm{.}0,2\mathrm{.}6,1\mathrm{.}3,-]]$

Click here for the Excel Data File

Which processing sequence will minimize the total setup time?

The sequence is $$

A$-$B$-$C

$A-C-B$

$B-A-C$

$B-C-A$

$C-A-B$

$C-B-A$