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

Authors: Saïd Toumi; Bassem Jarboui; Mansour Eddaly; Abdelwaheb Rebaï

Addresses: Al Majmaah University, College of Business Administration, KSA ' Emirates College of Technology, Abu Dhabi, UAE ' MODILS Laboratory, Faculty of Economics and Management, University of Sfax, Tunisia ' MODILS Laboratory, Faculty of Economics and Management, University of Sfax, Tunisia

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.

Keywords: scheduling; blocking flowshop; lower bound; total tardiness; total weighted tardiness.

DOI: 10.1504/IJOR.2017.087825

International Journal of Operational Research, 2017 Vol.30 No.4, pp.441 - 459

Received: 08 May 2014
Accepted: 23 Mar 2015

Published online: 06 Nov 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article