IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i4p545-d1585465.html
   My bibliography  Save this article

An Optimized Method for Solving the Green Permutation Flow Shop Scheduling Problem Using a Combination of Deep Reinforcement Learning and Improved Genetic Algorithm

Author

Listed:
  • 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)

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.

Suggested Citation

  • Yongxin Lu & Yiping Yuan & Jiarula Yasenjiang & Adilanmu Sitahong & Yongsheng Chao & Yunxuan Wang, 2025. "An Optimized Method for Solving the Green Permutation Flow Shop Scheduling Problem Using a Combination of Deep Reinforcement Learning and Improved Genetic Algorithm," Mathematics, MDPI, vol. 13(4), pages 1-37, February.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:4:p:545-:d:1585465
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/4/545/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/4/545/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:4:p:545-:d:1585465. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.