Multi-Agent Reinforcement Learning for Robust Job-Shop Rescheduling under Disruptions
Multi-Agent Reinforcement Learning for Robust Job-Shop Rescheduling under Disruptions
Description
Details
Context and Problem Statement
Offline production schedules quickly become obsolete after breakdowns or urgent orders. Aggressive replanning can destabilize operations, while overly conservative replanning sacrifices performance.
Research Question
What trade-off between performance and schedule stability can a learned multi-agent rescheduling policy achieve compared with dispatching rules and full re-optimization?
Proposed Approach
Model each machine as an agent, train a reinforcement-learning policy with a reward combining tardiness and deviation from the previous plan, connect it to a digital twin through industrial interoperability protocols, and compare against dispatching heuristics and exact solvers.
Expected Contribution
An explicit evaluation of the performance-stability trade-off and a decentralized architecture suitable for real manufacturing environments.
Expected Prototype
A digital-twin demonstrator showing updated schedules, magnitude of changes, and estimated delivery impact.
Datasets
Taillard and Demirkol benchmark instances plus execution and failure histories from a partner workshop.
Challenges
Combinatorial complexity, multi-agent non-stationarity, model-reality mismatch, operator acceptance, and MES integration.
Research Question
Innovation
Expected Deliverable
Technologies
Required Skills
- Operations Research and Scheduling
- Multi-Agent Reinforcement Learning
- Industrial Simulation
- Programming and Systems Integration
Datasets
- Taillard benchmark instances
- Demirkol benchmark instances
- Execution and failure histories from a partner workshop