In the branch and bound algorithm applied to minimize the makespan of the flow shop problem, the sequence is constructed

(a) From left to right

(b) From right to left

(c) From mid to right

(d) None of the above.

AppendixLO1