This paper deals with a permutation flowshop scheduling problem with blocking constraints. To minimise the makespan, it uses a branch-and-bound algorithm. A new lower bound is developed for the problem based upon the two machine-subproblem relaxation. Computational tests show the superiority of the proposed algorithm.
No takes yet. Share an insight, caveat, or question.
Toumi et al. (2016) studied this question.