PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 10, 2026Machines0 citationsOpen Access

Lot Streaming Optimization in Flexible Job Shop Scheduling via Deep Reinforcement Learning

View Full Paper
TCTiantian ChenJLJunqing LiLWLi Wei

Key Points

  • This research aims to optimize the Flexible Job Shop Scheduling Problem with batching constraints using an advanced algorithm.
  • Developed a dual-action deep reinforcement learning algorithm framework based on Enhanced Heterogeneous Graph Neural Network.
  • Integrated multi-dimensional features for dynamic information aggregation using Graph Attention Networks and Gated Recurrent Units.
  • Collaboratively optimized process sequencing and batch partitioning actions using the DAPPO algorithm.
  • The intelligent decision framework demonstrated improved scheduling quality compared to traditional algorithms.
  • Significantly enhanced adaptability to the complexity of the ECBFJSP was achieved.
  • Experimental results confirmed the framework's effectiveness and practicality in solving the ECBFJSP.

Abstract

In this study, a special version of the Flexible Job Shop Scheduling Problem with equally and consistently batching constraints (hereafter called ECBFJSP) is considered, which involves multiple aspects of coordination, such as machine selection, process sorting, and batch splitting, which is highly complex and places strict demands on the optimization strategy. To effectively meet this challenge, this study constructs a dual-action deep reinforcement learning algorithm framework based on the Enhanced Heterogeneous Graph Neural Network (EHGNN). First, an enhanced heterogeneous graph and EHGNN model for the ECBFJSP is innovatively proposed. By integrating multi-dimensional node features such as work order priority, machine tool processing capability, and process constraints, dynamic feature aggregation of various types of information is achieved with the help of GATs and GRUs. The model can output context-aware representations containing global resource constraints, greatly improving the joint optimization efficiency of job scheduling and batch partitioning and significantly enhancing the adaptability of the dual-action decision framework to the complexity of the ECBFJSP. At the decision-making mechanism level, this study designed a dual-action decision space of process sequencing–machine selection action and batch partitioning action and used the DAPPO algorithm to collaboratively optimize the dual-action strategy to ensure the stability and efficiency of the decision-making process. The experimental data results show that compared with traditional algorithms, the proposed intelligent decision framework performs better in scheduling quality when solving the ECBFJSP, which fully verifies the significant effectiveness and practicality of the framework in solving the ECBFJSP.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Chen et al. (2026) studied this question.

synapsesocial.com/papers/6a00217ac8f74e3340f9c680https://doi.org/10.3390/machines14050525
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1A review of lot streaming2013 · 96 citations
  2. 2Safe multi-agent reinforcement learning for multi-robot control2023 · 137 citations
  3. 3Solving the integrated lot-sizing and job-shop scheduling problem2014 · 34 citations
  4. 4Multi-Agent Proximal Policy Optimization-Based Dynamic Client Selection for Federated AI in 6G-Oriented Internet of Vehicles2024 · 20 citations
  5. 5Dynamic scheduling for flexible job-shop with reconfigurable manufacturing cells considering dynamic job arrivals based on deep reinforcement learning2025 · 21 citations