Branch and bound algorithm for solving blocking flowshop scheduling problem with total tardiness and total weighted tardiness criteria
by Saïd Toumi; Bassem Jarboui; Mansour Eddaly; Abdelwaheb Rebaï
International Journal of Operational Research (IJOR), Vol. 30, No. 4, 2017

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.

Online publication date: Mon, 06-Nov-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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