Three machine flowshop problem to minimize makespan:

Apply selected steps of Ignall$-$Schrage algorithm to determine selected branches of the search

tree $($Do not determine the complete Branch and Bound tree$)$

Determine the q$1,$ q$2,$ and q$3$ numbers for the partial schedule $($B$,\{$:${?}^{****,}{?}^{**})(5$ pts$)$

a$.$ Determine the q$1,$ q$2,$ and q$3$ numbers for the partial schedule $($D$,,{?}^{****},{?}^{**})(5$ pts$)$

b$.$ Determine the q$1,$ q$2,$ and q$3$ numbers for the partial schedule $)$

c$.$ BONUS Question $($for $10$ max credit$)$ Determine the optimal sequence and

present as a Gantt chart, or else a network diagram.