Improving ASP-Based ORS Schedules through Machine Learning Predictions

• Published in: Theory and practice of logic programming Vol. 25; no. 4; pp. 558 - 578
• Main Authors: BRUNO, PIERANGELA, DODARO, CARMINE, GALATÀ, GIUSEPPE, MARATEA, MARCO, MOCHI, MARCO
• Format: Journal Article
• Language: English
• Published: 22.08.2025
• ISSN: 1471-0684; 1475-3081; 1475-3081
• DOI: 10.1017/S1471068425100136

The operating room scheduling (ORS) problem deals with the optimization of daily operating room surgery schedules. It is a challenging problem subject to many constraints, like to determine the starting time of different surgeries and allocating the required resources, including the availability of beds in different department units. Recently, solutions to this problem based on answer set programming (ASP) have been delivered. Such solutions are overall satisfying but, when applied to real data, they can currently only verify whether the encoding aligns with the actual data and, at most, suggest alternative schedules that could have been computed. As a consequence, it is not currently possible to generate provisional schedules. Furthermore, the resulting schedules are not always robust. In this paper, we integrate inductive and deductive techniques for solving these issues. We first employ machine learning algorithms to predict the surgery duration, from historical data, to compute provisional schedules. Then, we consider the confidence of such predictions as an additional input to our problem and update the encoding correspondingly in order to compute more robust schedules. Results on historical data from the ASL1 Liguria in Italy confirm the viability of our integration.