Unified DRL for Enhanced Flexible Job-Shop Scheduling with Transportation Constraints
In the domain of smart manufacturing systems (SMSs),the flexible job-shop scheduling problem with transportation constraints (FJSPT) represents a crucial challenge and holds the potential to significantly enhance production efficiency. Extending beyond the traditional job-shop scheduling problem (JSP), FJSPT incorporates the scheduling of automated guided vehicles (AGVs) to transport intermediate products between machines. Despite the promise of deep reinforcement learning (DRL) in solving combinatorial optimization problems, there remains a notable scarcity of research employing DRL to tackle FJSPT. To address this gap, this paper introduces an end-to-end DRL approach for simultaneous scheduling of machines and AGVs in FJSPT. The proposed method amalgamates operation selection, machine assignment, and AGV planning into a unified decision-making process, leveraging a graph attention network (GAT) and the proximal policy optimization (PPO) algorithm for efficient and stable training. Experimental evaluations conducted on synthetic data and public instances demonstrate that the proposed method outperforms existing approaches in terms of scheduling performance and computational efficiency.
Authors
- Gang Wang (ORCID: https://orcid.org/0000-0002-7266-2412)
- Yijie Wang (ORCID: https://orcid.org/0000-0002-8598-2300)
- Jian Sun (ORCID: https://orcid.org/0000-0001-9898-3129)
- Runqing Wang (ORCID: https://orcid.org/0009-0004-6997-8602)
Institutions
- Beijing Institute of Technology (CN)
Publication Details
- Published
- 2024-11-01
- DOI
- https://doi.org/10.1109/cac63892.2024.10864691
- Citations
- 1
- Primary Topic
- Scheduling and Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.35