Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

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

International Journal of Mathematics in Operational Research, 2017, vol. 10, issue 1, 34-48

Abstract: This paper deals with a permutation flowshop scheduling problem with blocking constraints. To minimise the makespan, it uses a branch-and-bound algorithm. A new lower bound is developed for the problem based upon the two machine-subproblem relaxation. Computational tests show the superiority of the proposed algorithm.

Keywords: flowshop scheduling; blocking constraints; permutation flowshops; lower bound; branch-and-bound algorithm; makespan. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=80743 (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:ijmore:v:10:y:2017:i:1:p:34-48

Access Statistics for this article

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