Consider the following instance of the two$-$machine flow shop with the makespan as objective $($i$.$e$.,$ an instance of F$2||$ Cmax, which is a special case of J$2||$ Cmax$).$

jobs $1234567891011$ p$1$j $364342755612$

p$2$j $45523366472$

$($a$)$ Apply the heuristic described in Exercise $7\mathrm{.}1$ to this two$-$machine flow shop.

$($b$)$ Apply the shifting bottleneck heuristic to this two$-$machine flow shop. $($c$)$ Construct a schedule using Johnson$$s rule $($see Chapter $6).$

$($d$)$ Compare the schedules found under $($a$),($b$),$ and $($c$).$