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 and Yunxuan Wang
Additional contact information
Yongxin Lu: College of Mechanical Engineering, Xinjiang University, Urumqi 830049, China
Yiping Yuan: College of Mechanical Engineering, Xinjiang University, Urumqi 830049, China
Jiarula Yasenjiang: College of Mechanical Engineering, Xinjiang University, Urumqi 830049, China
Adilanmu Sitahong: College of Mechanical Engineering, Xinjiang University, Urumqi 830049, China
Yongsheng Chao: College of Mechanical Engineering, Xinjiang University, Urumqi 830049, China
Yunxuan Wang: College of Mechanical Engineering, Xinjiang University, Urumqi 830049, China

Mathematics, 2025, vol. 13, issue 4, 1-37

Abstract: 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.

Keywords: DRL; multi-objective optimization; PFSP; GA; energy-saving strategy (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/4/545/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/4/545/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:4:p:545-:d:1585465

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().