Improving ASP-based ORS Schedules through Machine Learning Predictions
Pierangela Bruno, Carmine Dodaro, Giuseppe Galat\`a, Marco Maratea, Marco Mochi

TL;DR
This paper enhances ASP-based operating room scheduling by integrating machine learning to predict surgery durations and improve schedule robustness, addressing limitations in current ASP solutions for real-world data.
Contribution
It introduces a novel integration of machine learning predictions with ASP to generate provisional and more robust OR schedules from historical data.
Findings
Machine learning accurately predicts surgery durations.
Predicted durations improve schedule robustness.
Integration confirms viability on real hospital data.
Abstract
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…
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.
