Flexible job shop scheduling with lot streaming based on improved migrating birds optimization algorithm

被引：0
|
作者：
Liu X. [1 ,2 ]
Duan C. [1 ]
Wang L. [1 ,2 ]
机构：
[1] School of Mechanical and Electronic Engineering, Wuhan University of Technology, Wuhan
[2] Hubei Provincial Digital Manufacturing Key Laboratory, Wuhan
来源：
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | 2021年 / 27卷 / 11期
基金：
中国国家自然科学基金;
关键词：
Disjunctive graph; Flexible job shop scheduling with lot streaming; Migration birds optimization algorithm; Variable sublots;
D O I：
10.13196/j.cims.2021.11.012
中图分类号：
学科分类号：
摘要：
The scheduling strategy of variable sublots is an effective method to improve the production efficiency of large-scale flexible job shop and the utilization rate of equipment. Aiming at the characteristics of Flexible Job-Shop Scheduling Problem with Variable Sublots (FJSP-VS), a multi-objective flexible job shop scheduling model with minimizing the completion time and the sublots number was established, and a disjunctive graph model for the problem was also established. An Improved Migrating Birds Optimization (IMBO) algorithm was proposed to solve the problem. In this algorithm, two strategies of the elite batch division and the feasible neighboring structures were designed to improve the search efficiency. The advantages of variable sublots and the effectiveness of the proposed algorithm were proved by comparative experiments. © 2021, Editorial Department of CIMS. All right reserved.
引用
收藏
页码：3185 / 3195
页数：10
相关论文
共 26 条
  • [1] BOZEK A, WERNER F., Flexible job shop scheduling with lot streaming and sublot size optimization, International Journal of Production Research, 56, 19, pp. 6391-6411, (2017)
  • [2] WANG Haiyan, WANG Wanliang, HUANG Fengli, Et al., Survey on production scheduling with lot splitting and prospect for energy-saving scheduling, Computer Integrated Manufacturing Systems, 23, 3, pp. 542-556, (2017)
  • [3] TSENG C T, LIAO C J., A discrete particle swarm optimization for lot-streaming flowshop scheduling problem, European Journal of Operational Research, 191, 2, pp. 360-373, (2008)
  • [4] MARTIN C H., A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming, Omega, 37, 1, pp. 126-137, (2009)
  • [5] VENTURA J A, YOON S H., A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers, Journal of Intelligent Manufacturing, 24, 6, pp. 1185-1196, (2013)
  • [6] MORTEZAEI N, ZULKIFLI N., A study on integration of lot sizing and flow shop lot streaming problems, Arabian Journal for Science and Engineering, 39, 12, pp. 9283-9300, (2014)
  • [7] MENG T, PAN Q K, LI J Q, Et al., An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem, Swarm and Evolutionary Computation, 38, pp. 64-78, (2018)
  • [8] BUSCHER U, SHEN L., An integrated tabu search algorithm for the lot streaming problem in job shops, European Journal of Operational Research, 199, 2, pp. 385-399, (2009)
  • [9] EDIS R S, ORNEK M A., Simulation analysis of lot streaming in job shops with transportation queue disciplines, Simulation Modelling Practice and Theory, 17, 2, pp. 442-453, (2009)
  • [10] LEI D M, GUO X P., Scheduling job shop with lot streaming and transportation through a modified artificial bee colony, International Journal of Production Research, 51, 16, pp. 4930-4941, (2013)
123