Flow shop scheduling with variable processing times based on differential shuffled frog leaping algorithm Online publication date: Mon, 06-Jan-2020
by Zhijun Gao; Jiayu Peng; Zhonghua Han; Meiqi Jia
International Journal of Modelling, Identification and Control (IJMIC), Vol. 33, No. 2, 2019
Abstract: In the problem of flexible flow shop scheduling with variable processing times, the change of processing speed often affects product quality and causes fluctuations in capacity, which makes it difficult to solve the scheduling problem. In the light of the flexible flow-shop scheduling problem with variable processing times (FFSP-VPT), the FFSP-VPT mathematical model is established. The improved differential shuffled frog leaping algorithm (DSFLA) serves as the global optimisation algorithm. It overcomes the shortcomings of the adaptive shuffled frog leaping algorithm which easily falls into local optimum and converges slowly. The two-stage coding method is used to determine the online sequence of the job and processing speed of the stage with variable processing times. The simulation experiments confirm the improvement of the shuffled frog leaping algorithm in global search ability and its effectiveness in solving the flexible flow shop scheduling problem with variable processing times.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook