Consider the following flow shop problem.

Job Machine 1 Machine 2 Machine 3 1 10 15 23 2 8 10 7 3 12 7 10 4 15 20 6 Find the optimal schedule for the above flow shop problem using branch and bound technique.

Also, determine the corresponding makespan.

AppendixLO1