Flow shop scheduling with variable processing times based on differential shuffled frog leaping algorithm

被引:8
|
作者
Gao, Zhijun [1 ]
Peng, Jiayu [1 ]
Han, Zhonghua [1 ]
Jia, Meiqi [1 ]
机构
[1] Shenyang Jianzhu Univ, Informat & Control Engn Sch, Shenyang 110168, Liaoning, Peoples R China
关键词
flexible flow shop scheduling; variable processing times; processing speed; fluctuations in capacity; DSFLA; differential shuffled frog leaping algorithm; two-stage coding;
D O I
10.1504/IJMIC.2019.104384
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:179 / 187
页数:9
相关论文
共 50 条
  • [1] Shuffled frog-leaping algorithm for order acceptance and scheduling in flow shop
    Lei, Deming
    Tan, Xianfeng
    PROCEEDINGS OF THE 35TH CHINESE CONTROL CONFERENCE 2016, 2016, : 9445 - 9450
  • [2] Flow Shop Scheduling Problem with Limited Buffer Based on Hybrid Shuffled Frog Leaping Algorithm
    Liang, Xu
    Wang, Peixuan
    Huang, Ming
    PROCEEDINGS OF 2019 IEEE 7TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2019), 2019, : 87 - 93
  • [3] Reentrant hybrid flow shop scheduling based on cooperated shuffled frog-leaping algorithm
    Lei D.
    Liu J.
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2023, 51 (05): : 125 - 130
  • [4] A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents
    Lei, Deming
    Guo, Xiuping
    EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (23) : 9333 - 9339
  • [5] An adaptive shuffled frog-leaping algorithm for flexible flow shop scheduling problem with batch processing machines
    Lei, Deming
    He, Chenyu
    APPLIED SOFT COMPUTING, 2024, 166
  • [6] An algorithm based on discrete shuffled frog leaping for No-idle permutation flow shop scheduling problem
    Wang, Ya-Min
    Ji, Jun-Zhong
    Pan, Quan-Ke
    Beijing Gongye Daxue Xuebao / Journal of Beijing University of Technology, 2010, 36 (01): : 124 - 130
  • [7] A novel shuffled frog-leaping algorithm for low carbon hybrid flow shop scheduling
    Lei D.-M.
    Yang D.-J.
    Lei, De-Ming (deminglei11@163.com), 1600, Northeast University (35): : 1329 - 1337
  • [8] An Effective Shuffled Frog Leaping Algorithm for Solving Hybrid Flow-Shop Scheduling Problem
    Xu, Ye
    Wang, Ling
    Zhou, Gang
    Wang, Shengyao
    ADVANCED INTELLIGENT COMPUTING, 2011, 6838 : 560 - 567
  • [9] Distributed assembly hybrid flow shop scheduling based on shuffled frog leaping algorithm with Q-learning
    Cai J.
    Wang L.
    Lei D.
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2023, 51 (12): : 37 - 44
  • [10] A shuffled frog-leaping algorithm for job shop scheduling with outsourcing options
    Lei, Deming
    Guo, Xiuping
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (16) : 4793 - 4804