Operational patient-bed assignment problem in large hospital settings including overflow and uncertainty management

  • Fabian Schäfer
  • Manuel Walther
  • Alexander HübnerEmail author
  • Heinrich Kuhn


Managing patient to bed allocations is an everyday task in hospitals which in recent years has moved into focus due to a general rise in occupancy levels and the resulting need to efficiently manage tight hospital bed-capacities. This holds true especially when being faced with high volatility and uncertainty regarding patient arrivals and lengths of stay. In our work with a large German hospital we identified three main stakeholders, namely patients, nurses, and doctors, whose individual objectives and constraints regarding patient-bed allocation (PBA) lead to a potential trade-off situation. We developed a decision support model that tackles the PBA problem considering this trade-off, while also being capable of handling overflow situations. In addition, we anticipate emergency patient arrivals based on historical probability distributions and account for uncertainty regarding patient arrival and discharge dates. We develop a greedy look-ahead heuristic which allows for generating solutions for large real-life operational planning situations involving high ratios of emergency patients. We demonstrate the performance of our heuristic approach by comparison with the results of a near-optimal solution achieved by Gurobi’s MIP solver. Finally, we tested our approach using data sets from the literature as well as actual clinic data from our case study hospital, for which we were able to reduce overflow by over 96% while increasing overall utilization by 5%.


Healthcare operations Bed management Patient-bed allocation Uncertainty management 


  1. Atkinson JB (1994) A greedy look-ahead heuristic for combinatorial optimization: an application to vehicle scheduling with time windows. J Oper Res Soc 45(6):673–684CrossRefGoogle Scholar
  2. Beliën J, Demeulemeester E (2007) Building cyclic master surgery schedules with leveled resulting bed occupancy. Eur J Oper Res 176(2):1185–1204CrossRefGoogle Scholar
  3. Bilgin B, Demeester P, Misir M, De Vancroonenburg W, Vanden Berghe G (2012) One hyper-heuristic approach to two timetabling problems in health care. J Heuristics 18(3):401–434CrossRefGoogle Scholar
  4. Ceschia S, Schaerf A (2011) Local search and lower bounds for the patient admission scheduling problem. Comput Oper Res 38(10):1452–1463MathSciNetCrossRefGoogle Scholar
  5. Ceschia S, Schaerf A (2012) Modeling and solving the dynamic patient admission scheduling problem under uncertainty. Artif Intell Med 56(3):199–205CrossRefGoogle Scholar
  6. Ceschia S, Schaerf A (2016) Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays. J Sched 19(4):377–389MathSciNetCrossRefGoogle Scholar
  7. Demeester P, Souffriau W, De Causmaecker P, Vanden Berghe G (2010) A hybrid tabu search algorithm for automatically assigning patients to beds. Artif Intell Med 48(1):61–70CrossRefGoogle Scholar
  8. Fügener A, Hans EW, Kolisch R, Kortbeek N, Vanberkel PT (2014) Master surgery scheduling with consideration of multiple downstream units. Eur J Oper Res 239(1):227–236MathSciNetCrossRefGoogle Scholar
  9. Gartner D, Kolisch R (2014) Scheduling the hospital-wide flow of elective patients. Eur J Oper Res 233(3):689–699MathSciNetCrossRefGoogle Scholar
  10. Gross CN, Fügener A, Brunner J (2017) Online rescheduling of physicians in hospitals. Flex Serv Manuf J 7(2):1–33Google Scholar
  11. Hübner A, Kuhn H, Walther M (2018) Combining clinical departments and wards in maximum-care hospitals. OR Spectr 40(3):679–709MathSciNetCrossRefGoogle Scholar
  12. Hübner A, Walther M, Kuhn H (2015) Approach to clustering clinical departments. In: Matta A (ed) Conference proceedings of second international conference on health care systems engineering. Proceedings in mathematics and statistics. Springer, Berlin, pp 111–120Google Scholar
  13. Hulshof PJH, Kortbeek N, Boucherie RJ, Hans EW, Bakker PJM (2012) Taxonomic classification of planning decisions in health care: a structured review of the state of the art in OR/MS. Health Syst 1(2):129–175CrossRefGoogle Scholar
  14. Hulshof PJH, Mes MRK, Boucherie RJ, Hans EW (2016) Patient admission planning using approximate dynamic programming. Flex Serv Manuf J 28(1–2):30–61CrossRefGoogle Scholar
  15. Range TM, Lusby RM, Larsen J (2014) A column generation approach for solving the patient admission scheduling problem. Eur J Oper Res 235(1):252–264CrossRefGoogle Scholar
  16. Schmidt R, Geisler S, Spreckelsen C (2013) Decision support for hospital bed management using adaptable individual length of stay estimations and shared resources. BMC Med Inform Decis Mak 13(3):1–19Google Scholar
  17. Vancroonenburg W, De Causmaecker P, Vanden Berghe G (2016) A study of decision support models for online patient-to-room assignment planning. Ann Oper Res 239(1):253–271MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  • Fabian Schäfer
    • 1
  • Manuel Walther
    • 2
  • Alexander Hübner
    • 1
    Email author
  • Heinrich Kuhn
    • 2
  1. 1.Chair of Supply and Value Chain ManagementTechnical University of MunichStraubingGermany
  2. 2.Supply Chain Management & OperationsCatholic University of Eichstätt-IngolstadtIngolstadtGermany

Personalised recommendations