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

Hongpei Li, Han Zhang, Ziyan He, Yunkai Jia, Bo Jiang +2 more
9/2/2024
math.OCcs.AIcs.LG

No official code found. Best implementation: Lhongpei/ipps-drl (17 stars, last commit 2025-10-04).

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.

View on arXivView PDF

Code Implementations(1)

Lhongpei/ipps-drlCommunity100%

A PyTorch-Based GPU Parallel Env for IPPS Problem, supporting DRL, IL and Learning Guided MCTS.

172C, C++Aug 16, 20241 years ago

Similar Papers

Cite this paper

@article{li2024solving,
  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},
  year   = {2024},
  eprint = {2409.00968},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.00968v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.00968.svg)](https://codeofpaper.com/paper/2409.00968)

Discussion