Reentrant hybrid flow shop scheduling problem with non-anticipatory sequence-dependent setup time
by Lu Chen; Jinfeng Wang; Yi Zhu
International Journal of Industrial and Systems Engineering (IJISE), Vol. 36, No. 4, 2020

Abstract: This paper studies a hybrid flow shop scheduling problem originated from a steam turbine rotor production. Reentrance and non-anticipatory sequence-dependent setup time are considered. The objectives are to minimise makespan and total tardiness. A mixed integer linear programming model is formulated. A bi-objective simulated annealing algorithm is developed to solve problems with real size. A modified version of the Nawaz-Enscore-Ham algorithm is applied to find a good initial solution and a Pareto search mechanism is introduced to find the Pareto set. The proposed bi-objective simulated annealing algorithm is compared with a single-objective algorithm. Experimental results demonstrate the superiority of the bi-objective algorithm. Sensitivity analysis provides valuable managerial insights for real production.

Online publication date: Mon, 04-Jan-2021

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 Industrial and Systems Engineering (IJISE):
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