An evolutionary algorithm for a hybrid flowshop scheduling problem with consistent sublots
by Xinli Zhang; Biao Zhang; Leilei Meng; Yaping Ren; Ronghua Meng; Junqing Li
International Journal of Automation and Control (IJAAC), Vol. 16, No. 1, 2022

Abstract: Lot streaming is the most often used technique to support the time-based strategy in the modern manufacturing system, which can split the jobs (or lots) with larger size into several sublots with smaller size. With this manufacturing technique, this paper studies a hybrid flowshop scheduling problem with consistent sublots (HFSP_CS). With the consideration of the integrated optimisation of lot sequencing and lot splitting, a mixed-integer linear programming (MILP) model is established with the objective of minimising the total flowtime. Since the NP-hard property of the problem, a solution method integrating the migrating birds optimisation (MBO) and variable neighbourhood descent (VND) algorithms is developed. Moreover, by taking into account the problem-special characteristics, the two-layer coding mechanism and a corresponding initialisation method are designed. Some heuristic methods are also presented in the decoding process. In the computational study, the effectiveness of the proposed algorithm is evaluated by comparing with CPLEX solver and other state-of-the-art algorithms.

Online publication date: Fri, 03-Dec-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 Automation and Control (IJAAC):
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