Improve OR-schedule to reduce number of required beds

Abstract

After surgery most of the surgical patients have to be admitted in a ward in the hospital. Due to financial reasons and an decreasing number of available nurses in the Netherlands over the years, it is important to reduce the bed usage as much as possible. One possible way to achieve this is to create an operating room (OR) schedule that spreads the usage of beds nicely over time, and thereby minimizes the number of required beds. An OR-schedule is given by an assignment of OR-blocks to specific days in the planning horizon and has to fulfill several resource constraints. Due to the stochastic nature of the length of stay of patients, the analytic calculation of the number of required beds for a given OR-schedule is a complex task involving the convolution of discrete distributions. In this paper, two approaches to deal with this complexity are presented. First, a heuristic approach based on local search is given, which takes into account the detailed formulation of the objective. A second approach reduces the complexity by simplifying the objective function. This allows modeling and solving the resulting problem as an ILP. Both approaches are tested on data provided by Hagaziekenhuis in the Netherlands. Furthermore, several what-if scenarios are evaluated. The computational results show that the approach that uses the simplified objective function provides better solutions to the original problem. By using this approach, the number of required beds for the considered instance of HagaZiekenhuis can be reduced by almost 20%