JOB LATENESS IN A 2-MACHINE FLOWSHOP WITH SETUP TIMES SEPARATED

This paper considers the two-machine flowshop problem of minimizing maximum lateness where setup times are separated from process times. Two sufficient conditions for optimality are presented. These conditions and a lower bound are used to develop a branch-and-bound solution procedure to arrive at an optimal solution. Computational results are also given. The computational results include comparison of the optimal solutions with the solutions obtained by two heuristic procedures based on the two sufficiency conditions mentioned earlier.