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

Abstract

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