An Optimized Method for Solving the Green Permutation Flow Shop Scheduling Problem Using a Combination of Deep Reinforcement Learning and Improved Genetic Algorithm
Yongxin Lu, Yiping Yuan, Jiarula Yasenjiang, Adilanmu Sitahong, Yongsheng Chao, Yunxuan Wang
Xinjiang University
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
This paper tackles the green permutation flow shop scheduling problem (GPFSP) with the goal of minimizing both the maximum completion time and energy consumption. It introduces a novel hybrid approach that combines end-to-end deep reinforcement learning with an improved genetic algorithm. Firstly, the PFSP is modeled using an end-to-end deep reinforcement learning (DRL) approach, named PFSP_NET, which is designed based on the characteristics of the PFSP, with the actor–critic algorithm employed to train the model. Once trained, this model can quickly and directly produce relatively high-quality solutions. Secondly, to further enhance the quality of the solutions, the outputs from PFSP_NET are used as the initial population for the improved genetic algorithm (IGA). Building upon the traditional genetic algorithm, the IGA utilizes three crossover operators, four mutation operators, and incorporates hamming distance, effectively preventing the algorithm from prematurely converging to local optimal solutions. Then, to optimize energy consumption, an energy-saving strategy is proposed that reasonably adjusts the job scheduling order by shifting jobs backward without increasing the maximum completion time. Finally, extensive experimental validation is conducted on the 120 test instances of the Taillard standard dataset. By comparing the proposed method with algorithms such as the standard genetic algorithm (SGA), elite genetic algorithm (EGA), hybrid genetic algorithm (HGA), discrete self-organizing migrating algorithm (DSOMA), discrete water wave optimization algorithm (DWWO), and hybrid monkey search algorithm (HMSA), the results demonstrate the effectiveness of the proposed method. Optimal solutions are achieved in 28 test instances, and the latest solutions are updated in instances Ta005 and Ta068 with values of 1235 and 5101, respectively. Additionally, experiments on 30 instances, including Taillard 20-10, Taillard 50-10, and Taillard 100-10, indicate that the proposed energy strategy can effectively reduce energy consumption.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
工程Scheduling and Optimization Algorithms
Advanced Manufacturing and Logistics Optimization · Healthcare Operations and Scheduling Optimization