Reducing the number of required beds by rearranging the OR-schedule
- 1.9k Downloads
After surgery most of the surgical patients have to be admitted in a ward in the hospital. Due to financial reasons and a 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 that 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 for instances based on the situation in HagaZiekenhuis. By using this approach, the number of required beds for the considered instance of HagaZiekenhuis can be reduced by almost 20 %.
KeywordsOperating room scheduling Ward occupancy Simulated annealing Integer programming
This research is supported by the Dutch Technology Foundation STW, applied science division of NWO and the Technology Program of the Ministry of Economic Affairs. Furthermore, we would like to thank the anonymous referees for their useful comments which helped to improve the paper.
- Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co Ltd, San FranciscoGoogle Scholar
- Hulshof PJH, Boucherie RJ, van Essen JT, Hans EW, Hurink JL, Kortbeek N, Litvak N, Vanberkel PT, van der Veen E, Veltman B, Vliegen IMH, Zonderland ME (2011) Orchestra: an online reference database of or/ms literature in health care. Health Care Manag Sci 14(4):383–384Google Scholar
- van Oostrum JM, van Houdenhoven M, Hurink JL, Hans EW, Wullink G, Kazemier G (2008) A master surgical scheduling approach for cyclic scheduling in operating room departments. OR Spectr 30(2): 355–374Google Scholar