An Optimization Method for Green Permutation Flow Shop Scheduling Based on Deep Reinforcement Learning and MOEA/D

被引:1
作者
Lu, Yongxin [1 ]
Yuan, Yiping [1 ]
Sitahong, Adilanmu [1 ]
Chao, Yongsheng [1 ]
Wang, Yunxuan [1 ]
机构
[1] Xinjiang Univ, Coll Mech Engn, Urumqi 830046, Peoples R China
基金
中国国家自然科学基金;
关键词
deep reinforcement learning; multi-objective optimization; permutation flow shop scheduling; MOEA/D algorithm; energy-saving strategy; HEURISTIC ALGORITHM; M-MACHINE; N-JOB; DECOMPOSITION;
D O I
10.3390/machines12100721
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper addresses the green permutation flow shop scheduling problem (GPFSP) with energy consumption consideration, aiming to minimize the maximum completion time and total energy consumption as optimization objectives, and proposes a new method that integrates end-to-end deep reinforcement learning (DRL) with the multi-objective evolutionary algorithm based on decomposition (MOEA/D), termed GDRL-MOEA/D. To improve the quality of solutions, the study first employs DRL to model the PFSP as a sequence-to-sequence model (DRL-PFSP) to obtain relatively better solutions. Subsequently, the solutions generated by the DRL-PFSP model are used as the initial population for the MOEA/D, and the proposed job postponement energy-saving strategy is incorporated to enhance the solution effectiveness of the MOEA/D. Finally, by comparing the GDRL-MOEA/D with the MOEA/D, NSGA-II, the marine predators algorithm (MPA), the sparrow search algorithm (SSA), the artificial hummingbird algorithm (AHA), and the seagull optimization algorithm (SOA) through experimental tests, the results demonstrate that the GDRL-MOEA/D has a significant advantage in terms of solution quality.
引用
收藏
页数:27
相关论文
共 63 条
[11]   AMARL: An Attention-Based Multiagent Reinforcement Learning Approach to the Min-Max Multiple Traveling Salesmen Problem [J].
Gao, Hao ;
Zhou, Xing ;
Xu, Xin ;
Lan, Yixing ;
Xiao, Yongqian .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (07) :9758-9772
[12]   Gated-Attention Model with Reinforcement Learning for Solving Dynamic Job Shop Scheduling Problem [J].
Gebreyesus, Goytom ;
Fellek, Getu ;
Farid, Ahmed ;
Fujimura, Shigeru ;
Yoshie, Osamu .
IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING, 2023, 18 (06) :932-944
[13]   FUNCTIONAL HEURISTIC ALGORITHM FOR FLOWSHOP SCHEDULING PROBLEM [J].
GUPTA, JND .
OPERATIONAL RESEARCH QUARTERLY, 1971, 22 (01) :39-&
[14]   A DEEP REINFORCEMENT LEARNING BASED SOLUTION FOR FLEXIBLE JOB SHOP SCHEDULING PROBLEM [J].
Han, B. A. ;
Yang, J. J. .
INTERNATIONAL JOURNAL OF SIMULATION MODELLING, 2021, 20 (02) :375-386
[15]   An improved multi-objective evolutionary algorithm based on decomposition for energy-efficient permutation flow shop scheduling problem with sequence-dependent setup time [J].
Jiang, En-da ;
Wang, Ling .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2019, 57 (06) :1756-1771
[16]  
Johnson S. M., 1954, Naval research logistics quarterly, V1, P61, DOI [10.1002/nav.3800010110, DOI 10.1002/NAV.3800010110]
[17]   An Improved Evolution Strategy Hybridization With Simulated Annealing for Permutation Flow Shop Scheduling Problems [J].
Khurshid, Bilal ;
Maqsood, Shahid ;
Omair, Muhammad ;
Sarkar, Biswajit ;
Ahmad, Imran ;
Muhammad, Khan .
IEEE ACCESS, 2021, 9 :94505-94522
[18]   Solving Optimization Problems Through Fully Convolutional Networks: An Application to the Traveling Salesman Problem [J].
Ling, Zhengxuan ;
Tao, Xinyu ;
Zhang, Yu ;
Chen, Xi .
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2021, 51 (12) :7475-7485
[19]   Dynamic Job-Shop Scheduling Problems Using Graph Neural Network and Deep Reinforcement Learning [J].
Liu, Chien-Liang ;
Huang, Tzu-Hsuan .
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2023, 53 (11) :6836-6848
[20]   A deep multi-agent reinforcement learning approach to solve dynamic job shop scheduling problem [J].
Liu, Renke ;
Piplani, Rajesh ;
Toro, Carlos .
COMPUTERS & OPERATIONS RESEARCH, 2023, 159