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

Source 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.