An Integrated HRL-GAT approach for dynamic cooperative scheduling in two-stage distributed hybrid flow shops

Abstract With the global shift in manufacturing toward distributed production paradigms, multi-factory collaborative scheduling faces complex challenges arising from the dynamic coupling of part manufacturing and product assembly. This study addresses the two-stage distributed hybrid flow shop scheduling problem. It establishes a comprehensive collaborative optimization model that integrates parallel processing across distributed factories and centralized assembly stages. To overcome decision bottlenecks under dynamic disturbances, we propose a novel scheduling method that combines hierarchical reinforcement learning (HRL) with a graph attention network (GAT), referred to as HRL-GAT. The main innovations include (1) the construction of a tri-channel dynamic state matrix that fuses machine load, remaining processing time, and part type features, enabling adaptive state updates through rule-based transformations; (2) a dual GAT mechanism, where the local GAT optimizes operation-level resource allocation based on machine idleness, and the global GAT models inter-factory synchronization of similar operations based on differences in remaining time; (3) the establishment of a hierarchical decision-making framework, where the high-level policy generates scheduling guidance using global statistics, and the low-level policy selects feasible actions within a subset constrained by action masking. The combination of HRL and GAT significantly improves scheduling accuracy while reducing training time, as demonstrated in static experiments. Moreover, simplifying the policy structure through a “first-order hybrid + second-order fixed rules” approach enhances scheduling efficiency. When compared to traditional heuristic algorithms, HRL-GAT shows clear advantages in scheduling performance. In dynamic rescheduling, the policy reuse mechanism demonstrates optimal performance, achieving coverage rates of 81.1% and 76.3% for small and large datasets, respectively. Furthermore, the model achieved collaborative gains of 5.1% and 6.3% for small and large datasets, respectively. The proposed HRL-GAT framework provides a new, efficient collaborative scheduling method for distributed manufacturing systems, significantly enhancing the dynamic adaptability and collaborative efficiency of complex production systems.

Authors

Institutions

Publication Details

Journal
Journal of Computational Design and Engineering
Published
2025-10-31
DOI
https://doi.org/10.1093/jcde/qwaf114
Citations
1
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
1.24
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Integrated HRL-GAT approach for dynamic cooperative scheduling in two-stage distributed hybrid flow shops

Xiaoying Yang, Bo Li, Yang Xin, Zhijie Pei
1 citations
Journal of Computational Design and Engineering
Scheduling and Optimization Algorithms
1.24
article

An Integrated HRL-GAT approach for dynamic cooperative scheduling in two-stage distributed hybrid flow shops

Xiaoying Yang, Bo Li, Yang Xin, Zhijie Pei
article en
1 citations

Abstract

Abstract With the global shift in manufacturing toward distributed production paradigms, multi-factory collaborative scheduling faces complex challenges arising from the dynamic coupling of part manufacturing and product assembly. This study addresses the two-stage distributed hybrid flow shop scheduling problem. It establishes a comprehensive collaborative optimization model that integrates parallel processing across distributed factories and centralized assembly stages. To overcome decision bottlenecks under dynamic disturbances, we propose a novel scheduling method that combines hierarchical reinforcement learning (HRL) with a graph attention network (GAT), referred to as HRL-GAT. The main innovations include (1) the construction of a tri-channel dynamic state matrix that fuses machine load, remaining processing time, and part type features, enabling adaptive state updates through rule-based transformations; (2) a dual GAT mechanism, where the local GAT optimizes operation-level resource allocation based on machine idleness, and the global GAT models inter-factory synchronization of similar operations based on differences in remaining time; (3) the establishment of a hierarchical decision-making framework, where the high-level policy generates scheduling guidance using global statistics, and the low-level policy selects feasible actions within a subset constrained by action masking. The combination of HRL and GAT significantly improves scheduling accuracy while reducing training time, as demonstrated in static experiments. Moreover, simplifying the policy structure through a “first-order hybrid + second-order fixed rules” approach enhances scheduling efficiency. When compared to traditional heuristic algorithms, HRL-GAT shows clear advantages in scheduling performance. In dynamic rescheduling, the policy reuse mechanism demonstrates optimal performance, achieving coverage rates of 81.1% and 76.3% for small and large datasets, respectively. Furthermore, the model achieved collaborative gains of 5.1% and 6.3% for small and large datasets, respectively. The proposed HRL-GAT framework provides a new, efficient collaborative scheduling method for distributed manufacturing systems, significantly enhancing the dynamic adaptability and collaborative efficiency of complex production systems.

Journal of Computational Design and EngineeringVol. 12(12)
Henan University of Science and Technology (CN), Jiaozuo University (CN)
Openalex Percentile: Top 14%
Scheduling and Optimization Algorithms
1.24
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.