A Comparative Study of Online versus Offline Machine Shop Scheduling Methods
Implementing complex online or offline scheduling solutions for machine shop scheduling is often difficult in practice, as these methods can be computationally expensive and difficult to understand. To provide a transition to these more complex solutions, this paper compares our proposed scheduling method based on a multi-agent system with state-of-the-art traditional offline and reinforcement learning-based online methods. Computational results indicate that our method is comparable to the existing complex offline and online methods, while computationally more advantageous, showcasing its effectiveness and flexibility.
Authors
- Ivo Adan (ORCID: https://orcid.org/0000-0002-4493-6367)
- Quang-Vinh Dang (ORCID: https://orcid.org/0000-0001-9838-5073)
- Jeroen B.H.C. Didden (ORCID: https://orcid.org/0000-0001-5270-5924)
Institutions
- VDL Groep (Netherlands) (NL)
- Eindhoven University of Technology (NL)
Publication Details
- Journal
- IFAC-PapersOnLine
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1016/j.ifacol.2025.09.372
- Primary Topic
- Scheduling and Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00