Effective and interpretable dispatching rules for dynamic job shops via guided empirical learning
Cristiane Ferreira, Gon\c{c}alo Figueira, Pedro Amorim

TL;DR
This paper introduces a novel guided empirical learning approach that combines domain reasoning with machine learning to develop effective, interpretable, and generalizable dispatching rules for dynamic job shop scheduling, outperforming existing methods.
Contribution
It presents the first integration of domain insights with empirical learning to create interpretable, high-performing dispatching rules that generalize across diverse scheduling scenarios.
Findings
Achieved an average of 19% improvement over existing rules.
Discovered new state-of-the-art dispatching rules.
Rules are compact, interpretable, and generalize well to unseen scenarios.
Abstract
The emergence of Industry 4.0 is making production systems more flexible and also more dynamic. In these settings, schedules often need to be adapted in real-time by dispatching rules. Although substantial progress was made until the '90s, the performance of these rules is still rather limited. The machine learning literature is developing a variety of methods to improve them, but the resulting rules are difficult to interpret and do not generalise well for a wide range of settings. This paper is the first major attempt at combining machine learning with domain problem reasoning for scheduling. The idea consists of using the insights obtained with the latter to guide the empirical search of the former. Our hypothesis is that this guided empirical learning process should result in dispatching rules that are effective and interpretable and which generalise well to different instance…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
