Graph reinforcement learning-driven source-load cooperative scheduling optimization for textile production

• Proposes graph reinforcement learning-driven source-load co-scheduling for textile production. • Constructs knowledge graph to characterize heterogeneous correlations of production-energy systems. • Establishes multi-objective MDP model to quantify dynamic trade-offs among makespan, carbon emission, and energy cost. • Utilizes heterogeneous attention GNN with adaptive greedy strategy, trained via PPO algorithm for real-time scheduling. • Case study demonstrates 2.9 % energy cost reduction, 10.1 % carbon emission decrease, and 1.1 % makespan increase. There are engineering issues caused by the traditional energy scheduling model where the energy generation (source) adjusts according to the energy consumption (load) in textile industrial parks, leading to a disconnect between the energy system and the production system, low energy efficiency, and high carbon emissions. This research proposes a graph reinforcement learning-driven source-load collaborative optimization method. Based on a domain knowledge graph fusing textile production processes, equipment status, and energy consumption relationships, the method explicitly characterizes the heterogeneous correlation of the source-load system. It further establishes a multi-objective Markov Decision Process model to quantify the dynamic game relationship among makespan, carbon emission index, and energy cost. To capture the complex, long-range dependencies in production processes, heterogeneous attention graph neural networks are used to capture the long-range dependencies in production links, combined with an adaptive greedy sampling strategy for optimizing scheduling decisions. Additionally, the Proximal Policy Optimization algorithm is adopted to train a hybrid scheduler, facilitating deep collaborative decision-making for both production processes and energy scheduling. Validation based on actual data from a Shanghai textile enterprise shows that the proposed method outperforms the benchmark, achieving a 10.1 % decrease in carbon emissions, a 2.9 % reduction in energy cost and a minimal 1.1 % increase in makespan. Furthermore, compared to the OR-Tools solver, the performance differences are limited to <4.0 %, 2.8 %, and 0.1 %, respectively, for energy costs, carbon emissions, and makespan.

Authors

Institutions

Publication Details

Journal
Digital engineering.
Published
2025-08-09
DOI
https://doi.org/10.1016/j.dte.2025.100061
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Graph reinforcement learning-driven source-load cooperative scheduling optimization for textile production

Ya-Ting Lan, Tsiat-Siong Tan, Tao Wu, Jinsong Bao et al.
1 links
Digital engineering.
Scheduling and Optimization Algorithms
article

Graph reinforcement learning-driven source-load cooperative scheduling optimization for textile production

Ya-Ting Lan, Tsiat-Siong Tan, Tao Wu, Jinsong Bao, Jie Li
article en

Abstract

• Proposes graph reinforcement learning-driven source-load co-scheduling for textile production. • Constructs knowledge graph to characterize heterogeneous correlations of production-energy systems. • Establishes multi-objective MDP model to quantify dynamic trade-offs among makespan, carbon emission, and energy cost. • Utilizes heterogeneous attention GNN with adaptive greedy strategy, trained via PPO algorithm for real-time scheduling. • Case study demonstrates 2.9 % energy cost reduction, 10.1 % carbon emission decrease, and 1.1 % makespan increase. There are engineering issues caused by the traditional energy scheduling model where the energy generation (source) adjusts according to the energy consumption (load) in textile industrial parks, leading to a disconnect between the energy system and the production system, low energy efficiency, and high carbon emissions. This research proposes a graph reinforcement learning-driven source-load collaborative optimization method. Based on a domain knowledge graph fusing textile production processes, equipment status, and energy consumption relationships, the method explicitly characterizes the heterogeneous correlation of the source-load system. It further establishes a multi-objective Markov Decision Process model to quantify the dynamic game relationship among makespan, carbon emission index, and energy cost. To capture the complex, long-range dependencies in production processes, heterogeneous attention graph neural networks are used to capture the long-range dependencies in production links, combined with an adaptive greedy sampling strategy for optimizing scheduling decisions. Additionally, the Proximal Policy Optimization algorithm is adopted to train a hybrid scheduler, facilitating deep collaborative decision-making for both production processes and energy scheduling. Validation based on actual data from a Shanghai textile enterprise shows that the proposed method outperforms the benchmark, achieving a 10.1 % decrease in carbon emissions, a 2.9 % reduction in energy cost and a minimal 1.1 % increase in makespan. Furthermore, compared to the OR-Tools solver, the performance differences are limited to <4.0 %, 2.8 %, and 0.1 %, respectively, for energy costs, carbon emissions, and makespan.

Digital engineering.Vol. 7
Donghua University (CN)
Natural Science Foundation of Shanghai, National Natural Science Foundation of China
Decent work and economic growth
Openalex Percentile: Top 71%
Scheduling and Optimization Algorithms
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.