An adaptive large neighbourhood search algorithm for blocking flowshop scheduling problem with sequence-dependent setup times
by Faezeh Bagheri; Morteza Kazemi; Ardavan Asef-Vaziri; Mahsa Mahdavisharif
International Journal of Operational Research (IJOR), Vol. 50, No. 2, 2024

Abstract: Flowshop scheduling problem (FSP) belongs to the classical combinatorial optimisation problem and takes different forms under different production conditions. To make the general form of FSP closer to the real production environment, two assumptions, including blocking and sequence-dependent setup time, were added. The first attempt of the current research work is proposing a mathematical model according to two different viewpoints about blocking occurrence affected by sequence-dependent setup time that try to use the dead time (blocking or idle time) for setting-up the next job. Due to the complex intrinsic of combinatorial problems, achieving the exact result on a large-scale through a mathematical model is almost complicated. The second attempt is developing an adaptive large neighbourhood search algorithm to solve the problem on a large-scale which is accelerated by a new constructive heuristic algorithm. Extensive computational experiments on various size problems support the efficiency of the proposed algorithms.

Online publication date: Tue, 04-Jun-2024

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