English

Solving Integrated Process Planning and Scheduling Problem via Graph Neural Network Based Deep Reinforcement Learning

Optimization and Control 2024-09-04 v1 Artificial Intelligence Machine Learning

Abstract

The Integrated Process Planning and Scheduling (IPPS) problem combines process route planning and shop scheduling to achieve high efficiency in manufacturing and maximize resource utilization, which is crucial for modern manufacturing systems. Traditional methods using Mixed Integer Linear Programming (MILP) and heuristic algorithms can not well balance solution quality and speed when solving IPPS. In this paper, we propose a novel end-to-end Deep Reinforcement Learning (DRL) method. We model the IPPS problem as a Markov Decision Process (MDP) and employ a Heterogeneous Graph Neural Network (GNN) to capture the complex relationships among operations, machines, and jobs. To optimize the scheduling strategy, we use Proximal Policy Optimization (PPO). Experimental results show that, compared to traditional methods, our approach significantly improves solution efficiency and quality in large-scale IPPS instances, providing superior scheduling strategies for modern intelligent manufacturing systems.

Keywords

Cite

@article{arxiv.2409.00968,
  title  = {Solving Integrated Process Planning and Scheduling Problem via Graph Neural Network Based Deep Reinforcement Learning},
  author = {Hongpei Li and Han Zhang and Ziyan He and Yunkai Jia and Bo Jiang and Xiang Huang and Dongdong Ge},
  journal= {arXiv preprint arXiv:2409.00968},
  year   = {2024}
}

Comments

24 pages, 13 figures

R2 v1 2026-06-28T18:30:59.747Z