Improved lion swarm optimization algorithm to solve the multi-objective rescheduling of hybrid flowshop with limited buffer

被引:1
|
作者
Guan, Tingyu [1 ]
Wen, Tingxin [1 ]
Kou, Bencong [1 ]
机构
[1] Liaoning Tech Univ, Sch Business Adm, Huludao 125105, Peoples R China
关键词
Rescheduling; Energy consumption; Satisfaction; Lion swarm optimization algorithm; Limited buffer; ENERGY-CONSUMPTION;
D O I
10.1016/j.jksuci.2024.102077
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As the realities of production and operation in green and intelligent workshops become more variable, the adverse risks arising from disruptions to modernized workshop energy consumption schedules and customer churn caused by dynamic events are increasing. In order to solve those problems, we take the intelligent hybrid flow shop as the research subject, use buffer capacity and automated guided vehicles (AGVs) transport devices as resource constraints, construct a multi-objective rescheduling model that considers both energy consumption and customer satisfaction. According to the model characteristics, an improved lion swarm optimization algorithm (ILSO) is designed to solve the above model. To improve the initial solution quality and global search capability of the algorithm, ILSO is improved by combining the reverse learning initialization strategy of Logistic chaotic mapping with the tabu search strategy. The results of experiments on the proposed algorithm with different sizes of arithmetic cases and real cases in the workshop indicate that ILSO can effectively solve the bi-objective rescheduling problem oriented to inserting orders, and the proposed model can provide green dynamic scheduling solutions for manufacturing enterprises to achieve the purpose of transformation to green intelligent manufacturing.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] A multi-objective migrating birds optimization algorithm for the hybrid flowshop rescheduling problem
    Biao Zhang
    Quan-ke Pan
    Liang Gao
    Xin-li Zhang
    Kun-kun Peng
    Soft Computing, 2019, 23 : 8101 - 8129
  • [2] A multi-objective migrating birds optimization algorithm for the hybrid flowshop rescheduling problem
    Zhang, Biao
    Pan, Quan-ke
    Gao, Liang
    Zhang, Xin-li
    Peng, Kun-kun
    SOFT COMPUTING, 2019, 23 (17) : 8101 - 8129
  • [3] An improved multi-objective firefly algorithm for energy-efficient hybrid flowshop rescheduling problem
    Wang, Ziyue
    Shen, Liangshan
    Li, Xinyu
    Gao, Liang
    JOURNAL OF CLEANER PRODUCTION, 2023, 385
  • [4] An Improved Hybrid Multi-objective Particle Swarm Optimization Algorithm
    Zhou, Zuan
    Dai, Guangming
    Fang, Pan
    Chen, Fangjie
    Tan, Yi
    ADVANCES IN COMPUTATION AND INTELLIGENCE, PROCEEDINGS, 2008, 5370 : 181 - 188
  • [5] A multi-objective evolutionary algorithm for the hybrid flowshop rescheduling problem with lot streaming
    Zhang, Biao
    Meng, Leilei
    Zhang, Xinli
    PROCEEDINGS OF THE 33RD CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2021), 2021, : 5163 - 5168
  • [6] MOEA/D for Multi-objective Hybrid Flowshop Rescheduling Problem
    Zhang, Biao
    Pan, Quan-ke
    Gao, Liang
    Zhao, Yao-bang
    PROCEEDINGS OF THE ASME 13TH INTERNATIONAL MANUFACTURING SCIENCE AND ENGINEERING CONFERENCE, 2018, VOL 4, 2018,
  • [7] Improved multi-objective particle swarm optimization algorithm
    College of Automation, Northwestern Polytechnical University, Xi'an 710129, China
    不详
    Liu, B. (lbn1987113@163.com), 2013, Beijing University of Aeronautics and Astronautics (BUAA) (39):
  • [8] An improved multi-objective particle swarm optimization algorithm
    Zhang, Qiuming
    Xue, Siqing
    ADVANCES IN COMPUTATION AND INTELLIGENCE, PROCEEDINGS, 2007, 4683 : 372 - +
  • [9] A particle swarm optimization for multi-objective flowshop scheduling
    D. Y. Sha
    Hsing Hung Lin
    The International Journal of Advanced Manufacturing Technology, 2009, 45 (7-8) : 749 - 758
  • [10] A particle swarm optimization for multi-objective flowshop scheduling
    Sha, D. Y.
    Lin, Hsing-Hung
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 45 (7-8): : 749 - 758