A study of flexible flow shop scheduling problem with variable processing times based on improved bat algorithm
by Jianyong Bian; Liying Yang
International Journal of Simulation and Process Modelling (IJSPM), Vol. 15, No. 3, 2020

Abstract: In order to solve the problem of flexible flow shop scheduling with variable processing time (FFSP-VPT), a mathematical model is established, in this paper, based on analysing the processing time selection, defect detection, and rework of jobs with variable processing time. According to the characteristics of FFSP-VPT, a two-stage coding method is designed using ranked over value (ROV) coding. Based on the bat algorithm (BA), a self-adaptive elite bat algorithm (SEBA) is developed as the global optimisation method in this study by using Hamming distance-based elite individual set and adaptive position update. Crossover tests are designed to determine the optimal values of critical parameters in SEBA. Validity of SEBA on solving FFSP-VPT in actual production is verified by comparing the simulation test results of SEBA with those of other algorithms.

Online publication date: Fri, 15-May-2020

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 Simulation and Process Modelling (IJSPM):
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