Effective and interpretable dispatching rules for dynamic job shops via guided empirical learning

Download Link
Time Added
6/20/2022, 12:18:58 PM
Machine Learning
Total Downloads
Cristiane Ferreira Gonçalo Figueira and Pedro Amorim
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. However 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. We hypothesise that this guided empirical learning process should result in effective and interpretable dispatching rules that generalise well to different scenarios. We test our approach in the classical dynamic job shop scheduling problem minimising tardiness one of the most well-studied scheduling problems. The simulation experiments include a wide spectrum of scenarios for the first time from highly loose to tight due dates and from low utilisation conditions to severely congested shops. Nonetheless results show that our approach can find new state-of-the-art rules which significantly outperform the existing literature in the vast majority of settings. Overall the average improvement over the best combination of benchmark rules is 19%. Moreover the rules are compact inter
Scheduling ; Dynamic Job Shop ; Dispatching Rules ; Genetic Programming (search for similar items in EconPapers)
Year Published
Omega 2022 vol. 111 issue C