Lower bounds on the total tardiness and total weighted tardiness for scheduling flowshop with blocking

This paper proposes new machine based lower bounds for scheduling the flowshop with blocking constraints problem while minimizing the total tardiness and total weighted tardiness. Some characteristics of the developed branch and bound algorithm are discussed and computational experiments on several random instances are presented. The obtained results compare favorably with previous works in the literature.