Clustering clinical departments for wards to achieve a prespecified blocking probability
- 233 Downloads
When the number of available beds in a hospital is limited, it can be beneficial to cluster several clinical departments such that the probability of not being able to admit a patient is acceptably small. However, not all clinical departments can be clustered for cross-infection reasons. In addition, patients from one clinical department should not be spread out over the entire hospital as this complicates the process of doing rounds and may result in alternate level of care. In this paper, we consider a situation where wards with a fixed number of beds are given. The question is how to cluster the clinical departments and to determine the assignment of these clustered departments to the available wards such that the assigned beds are sufficient to guarantee a blocking probability below a prespecified percentage. We first give an exact formulation of the problem to be able to achieve optimal solutions. However, computational experiments show that the resulting computation times for this model are too long for it to be applicable in practice. To reduce the computation time, we introduce two heuristic solution approaches. The first heuristic uses the same formulation as the exact model, however, the number of required beds is approximated by a linear function. The resulting model is again solved by an exact solver. The second heuristic uses a restricted version of the exact model within a local search approach. Hereby, the local search is used to determine the assignment of clinical departments to clusters and the exact model is used to determine the assignment of clusters to wards.
KeywordsHospitals Layout Wards Integer programming Heuristics
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. We would like to thank the anonymous referees and Erwin Hans for their useful comments which helped to improve the paper.
- van Essen JT, Bosch JM, Hans EW, van Houdenhoven M, Hurink JL (2013) Reducing the number of required beds by rearranging the OR-schedule. OR Spectr 1–21. doi: 10.1007/s00291-013-0323-x
- Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co Ltd., New YorkGoogle Scholar
- Green LV, Nguyen V (2001) Strategies for cutting hospital beds: the impact on patient service. Health Serv Res 36(2):421–442Google Scholar
- Qiao S, Qiao L (1998) A robust and efficient algorithm for evaluating Erlang b formula. Technical reportGoogle Scholar
- Shakhov V (2010) Simple approximation for Erlang b formula. In: Proceedings of 2010 IEEE Region 8th international conference on computational technologies in electrical and electronics engineering (SIBIRCON), pp 220–222Google Scholar
- Williams HP (1999) Model building in mathematical programming. Wiley, HobokenGoogle Scholar