A reinforcement learning-driven brain storm optimisation algorithm for multi-objective energy-efficient distributed assembly no-wait flow shop scheduling problem

被引:68
作者
Zhao, Fuqing [1 ]
Hu, Xiaotong [1 ]
Wang, Ling [2 ]
Xu, Tianpeng [1 ]
Zhu, Ningning [1 ,3 ]
Zhu, Ningning [1 ,3 ]
机构
[1] Lanzhou Univ Technol, Sch Comp & Commun Technol, Lanzhou 730050, Peoples R China
[2] Tsinghua Univ, Dept Automat, Beijing, Peoples R China
[3] Univ Andalas, Dept Ind Engn, Padang, Indonesia
基金
中国国家自然科学基金;
关键词
Energy-efficient; no-wait flow shop; brain storm optimisation; Q-learning mechanism; product assignment rule; clustering mechanism; SEARCH ALGORITHM; TIME; FLOWSHOPS; TARDINESS; MINIMIZE;
D O I
10.1080/00207543.2022.2070786
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A reinforcement learning-driven brain storm optimisation idea (RLBSO) is proposed in this paper to solve multi-objective energy-efficient distributed assembly no-wait flow shop scheduling problem. The objectives of the problem include minimising the maximum assembly completion time (C-max), minimising the total energy consumption (TEC) and achieving resource allocation balanced . Four operations, which are critical factory insert, critical factory swap, critical factory insert to other factories, critical factory swap with other factories, are designed to optimise the objective of maximum assembly completion time. Q-learning mechanism is utilised to guide the selection of operations to avoid blind search in the iteration process. The learning mechanism based on clustering mechanism in brain storm optimisation algorithm is utilised to assign products to factories in the objective space according to the processing time of products to balance the resources allocation. The speed of operations on non-critical path is slowed down to reduce TEC regarded with the characteristics of no-wait flow shop scheduling problem. The experimental results under 810 large-scale instances by RLBSO show that the RLBSO outperforms the comparison algorithm for addressing the problem.
引用
收藏
页码:2853 / 2871
页数:19
相关论文
共 56 条
[1]   Minimising maximum tardiness in assembly flowshops with setup times [J].
Aydilek, Asiye ;
Aydilek, Harun ;
Allahverdi, Ali .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (24) :7541-7565
[2]   Self-adaptive brainstorming for jobshop scheduling in multicloud environment [J].
Bhatt, Ashutosh ;
Dimri, Priti ;
Aggarwal, Ambika .
SOFTWARE-PRACTICE & EXPERIENCE, 2020, 50 (08) :1381-1398
[3]   A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling [J].
Chen, Jing-fang ;
Wang, Ling ;
Peng, Zhi-ping .
SWARM AND EVOLUTIONARY COMPUTATION, 2019, 50
[4]   A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem [J].
Deng, Jin ;
Wang, Ling ;
Wang, Sheng-yao ;
Zheng, Xiao-long .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (12) :3561-3577
[5]   No-wait two-stage flowshop problem with multi-task flexibility of the first machine [J].
Dong, Jianming ;
Pan, Hong ;
Ye, Cunkui ;
Tong, Weitian ;
Hu, Jueliang .
INFORMATION SCIENCES, 2021, 544 :25-38
[6]   A review of energy-efficient scheduling in intelligent production systems [J].
Gao, Kaizhou ;
Huang, Yun ;
Sadollah, Ali ;
Wang, Ling .
COMPLEX & INTELLIGENT SYSTEMS, 2020, 6 (02) :237-249
[7]   Grid-based dynamic robust multi-objective brain storm optimization algorithm [J].
Guo, Yinan ;
Yang, Huan ;
Chen, Meirong ;
Go, Dunwei ;
Cheng, Shi .
SOFT COMPUTING, 2020, 24 (10) :7395-7415
[8]   Discrete evolutionary multi-objective optimization for energy-efficient blocking flow shop scheduling with setup time [J].
Han, Yuyan ;
Li, Junqing ;
Sang, Hongyan ;
Liu, Yiping ;
Gao, Kaizhou ;
Pan, Quanke .
APPLIED SOFT COMPUTING, 2020, 93
[9]  
Heger J., 2021, INT J PROD RES, V4, P1
[10]   Robust Optimal Energy Management of a Residential Microgrid Under Uncertainties on Demand and Renewable Power Generation [J].
Hosseini, Seyed Mohsen ;
Carli, Raffaele ;
Dotoli, Mariagrazia .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2021, 18 (02) :618-637