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

Saïd Toumi, Bassem Jarboui, Mansour Eddaly and Abdelwaheb Rebaï

International Journal of Operational Research, 2017, vol. 30, issue 4, 441-459

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. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=87825 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:30:y:2017:i:4:p:441-459

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().