Automatic algorithm design for multi-objective hybrid flowshop scheduling problem with variable sublots

被引:0
|
作者
Zhang B. [1 ]
Meng L. [1 ]
Sang H. [1 ]
Lu C. [2 ]
机构
[1] School of Computer Science, Liaocheng University, Liaocheng
[2] School of Computer Science, China University of Geosciences, Wuhan
来源
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | 2022年 / 28卷 / 11期
关键词
automatic algorithm design; hybrid flowshop scheduling; multi-objective evolutionary algorithm; variable sublots;
D O I
10.13196/j.cims.2022.11.007
中图分类号
学科分类号
摘要
With the consideration of setup and transportation operations,the multi-objective hybrid flowshop scheduling problem with variable sublots was studied,which was aimed to simultaneously optimize two conflicting objectives :the makespan and the total number of sublots. A multi-objective mixed integer programming model was developed and the trade-off between the two objectives was evaluated. Since the problem belongs to Non-deterministic Polynomial (NP) problems,the Multi-objective Evolutionary Algorithm (MOEA) was suggested to solve it. To e-liminate the biases of previous experience for configuring MOEA, an Automated Algorithm Design (AAD) methodology was introduced to conceive a promising MOEA based on MOEA framework,which was enabled designing the MOEA by determining parameters and their combinations automatically with minimal user intervention. Considering the variable sublots,a dynamic decoding strategy was proposed. With regards to the problem-specific characteristics and the employed algorithm framework,for the categorical and numerical parameters,reasonable value ranges were given. For the AAD methodology,the I/F-Race was employed. Compared with CPLEX,the automated MOEA was demonstrated much more effective. © 2022 CIMS. All rights reserved.
引用
收藏
页码:3403 / 3420
页数:17
相关论文
共 28 条
  • [1] RUIZ R, VAZQUEZ-RODRIGUEZ J A., The hybrid flow shop scheduling problem, European Journal of Operational Research, 205, 1, pp. 1-18, (2010)
  • [2] LI Yingli, LIXinyu, GAO Liang, Review on hybrid flow shop scheduling problems, JX China Mechanical Engineering, 31, 23, pp. 2798-2813, (2020)
  • [3] MENG Leilei, Et al., Hybrid flow-shop scheduling problems based on improved migrating birds optimization algorithm[j], Computer Integrated Manufacturing Systems, 25, 3, pp. 643-653, (2019)
  • [4] CAI Jingcao, LEI Deming, Distributed two-stage hybrid flow shop scheduling with setup times [j], Computer Integrated Manufacturing Systems, 26, 8, pp. 2170-2179, (2020)
  • [5] CUI Qi, WU Xiuli, YU J Jianjun, Improved genetic algorithm variable neighborhood search for solving hybrid flow shop scheduling problem [j], Computer Integrated Manufacturing Systems, 23, 9, pp. 1917-1927, (2017)
  • [6] WANG Shengyao, WANG Ling, XU Ye, Et al., An estimation of distribution algorithm for solving hybrid flow-shop scheduling problem, Acta Automatica Sinica, 38, 3, pp. 437-443, (2012)
  • [7] WANG Fang, TANG Qiuhua, RAO Yunqing, Et al., Efficient estimation of distribution for flexible hybrid flow shop sched-uling, Acta Automatics Sinica, 43, 2, pp. 280-293, (2017)
  • [8] REITER S., A system for managing job-shop production, The Journal of Business, 39, 3, pp. 371-393, (1966)
  • [9] SANG Hongyan, Research on solving method for flowshop scheduling problem with lot streaming, (2013)
  • [10] CHENG M, MUKHERJEE N J, SARIN S C., A review of lot streaming, International Journal of Production Research, 51, 23-24, pp. 7023-7046, (2013)