Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion Online publication date: Tue, 06-Dec-2016
by Saïd Toumi; Bassem Jarboui; Mansour Eddaly; Abdelwaheb Rebaï
International Journal of Mathematics in Operational Research (IJMOR), Vol. 10, No. 1, 2017
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com