Branch and bound algorithm for solving blocking flowshop scheduling problem with total tardiness

This paper addresses to the scheduling of a permutation flowshop scheduling problem with blocking constraints to minimize the total tardiness with a branch and bound algorithm. New machine based lower bound was developed for the problem. The experimental results have shown the efficiency of the proposed algorithm both in terms of solutions quality and time requirements.