Machine learning for surgical time prediction

Operating Rooms (ORs) are among the most expensive services in hospitals. A challenge to optimize the OR efficiency is to improve the surgery scheduling task, which requires the estimation of surgical time duration. Surgeons or programming units (based on people's experience) typically do the duration estimation using an experience-based strategy, which may include some bias, such as overestimating the surgery time, increasing ORs' operational cost.

This paper analyzes a machine learning-based solution for surgical time predictions. We apply and compare four machine-learning algorithms (Linear Regression, Support Vector Machines, Regression Trees, and Bagged Trees) to predict the surgical time duration at a tertiary referral university hospital in Bogotá, Colombia. Historical data from 2004 until 2019 was used to train the algorithms. Comparison among algorithms was given in terms of the Root Mean Square Error (RMSE) of the predicted surgery duration and the algorithms' computing time. The algorithm with the best performance was compared to the currently used experience-based method.

All the ML algorithms predict the surgery duration with an error between 26 and 37 min. The best overall performance was obtained using Bagged Trees (26 min RMSE, 3.16 min training time, 0.49 min testing time) when using a subset of the DB with the nine specialties containing 80% of the surgeries. Bagged Trees also outperformed the experience-based method with a lower RMSE; however, it also shifted from a predominant overestimation to underestimating surgeries' duration.

Different ML algorithms for predicting the surgical time duration, showing and comparing their performance. Bagged Trees showed the best performance in terms of RMSE and computing time. Depending on the initial data, Bagged Trees outperformed the experience-based method, but future work is necessary to suit it, like any other ML algorithm, to the hospitals' needs.