Skip to main content

One Transfer per Patient Suffices: Structural Insights About Patient-to-Room Assignment

  • Conference paper
  • First Online:
Combinatorial Optimization (ISCO 2022)

Abstract

Assigning patients to rooms is a fundamental task in hospitals and, especially, within wards. For this so-called patient-to-room assignment problem (PRA) many heuristics have been proposed with a large variety of different practical constraints. However, a thorough investigation of the problem’s structure itself has been neglected so far. In this paper, we present insights about the basic, underlying combinatorial problem of PRA forbidding gender-mixed room assignments with a focus on minimizing the number of patient transfers which occur if patients have to change rooms during their stay. Particularly, we prove that in the case of double bedrooms, each patient has to be transferred at most once.

This work was supported by the Freigeist-Fellowship of the Volkswagen Stiftung and by the German research council (DFG) Research Training Group 2236 UnRAVeL. This work was partially supported by the German Federal Ministry of Education and Research (grant no. 05M16PAA) within the project “HealthFaCT - Health: Facility Location, Covering and Transport”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Abdalkareem, Z.A., Amir, A., Al-Betar, M.A., Ekhan, P., Hammouri, A.I.: Healthcare scheduling in optimization context: a review. Health Technol. 11(3), 445–469 (2021). https://doi.org/10.1007/s12553-021-00547-5

    Article  Google Scholar 

  2. Ceschia, S., Schaerf, A.: Local search and lower bounds for the patient admission scheduling problem. Comput. Oper. Res. 38(10), 1452–1463 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ceschia, S., Schaerf, A.: Modeling and solving the dynamic patient admission scheduling problem under uncertainty. Artif. Intell. Med. 56(3), 199–205 (2012)

    Article  Google Scholar 

  4. Ceschia, S., Schaerf, A.: Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays. J. Sched. 19(4), 377–389 (2016). https://doi.org/10.1007/s10951-014-0407-8

    Article  MathSciNet  MATH  Google Scholar 

  5. Cochran, J.K., Bharti, A.: Stochastic bed balancing of an obstetrics hospital. Health Care Manag. Sci. 9(1), 31–45 (2006). https://doi.org/10.1007/s10729-006-6278-6

    Article  Google Scholar 

  6. Demeester, P., Souffriau, W., De Causmaecker, P., Vanden Berghe, G.: A hybrid tabu search algorithm for automatically assigning patients to beds. Artif. Intell. Med. 48(1), 61–70 (2010)

    Article  Google Scholar 

  7. Ficker, A.M.C., Spieksma, F.C.R., Woeginger, G.J.: The transportation problem with conflicts. Ann. Oper. Res. 298(1), 207–227 (2021). https://doi.org/10.1007/s10479-018-3004-y

    Article  MathSciNet  MATH  Google Scholar 

  8. Guido, R., Groccia, M.C., Conforti, D.: An efficient matheuristic for offline patient-to-bed assignment problems. Eur. J. Oper. Res. 268(2), 486–503 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hammouri, A.I., Alrifai, B.: Investigating biogeography-based optimisation for patient admission scheduling problems. J. Theor. Appl. Inf. Technol. 70(3), 413–421 (2014)

    Google Scholar 

  10. Harper, P.R.: A framework for operational modelling of hospital resources. Health Care Manag. Sci. 5(3), 165–173 (2002). https://doi.org/10.1023/A:1019767900627

    Article  Google Scholar 

  11. Harper, P.R., Shahani, A.K., Gallagher, J.E., Bowie, C.: Planning health services with explicit geographical considerations: a stochastic location-allocation approach. Omega 33(2), 141–152 (2005)

    Article  Google Scholar 

  12. Harrison, G.W., Shafer, A., Mackay, M.: Modelling variability in hospital bed occupancy. Health Care Manag. Sci. 8(4), 325–334 (2005). https://doi.org/10.1007/s10729-005-4142-8

    Article  Google Scholar 

  13. Huang, X.M.: A planning model for requirement of emergency beds. Math. Med. Biol. J. IMA 12(3–4), 345–353 (1995)

    Article  Google Scholar 

  14. Hübner, A., Kuhn, H., Walther, M.: Combining clinical departments and wards in maximum-care hospitals. OR Spectr. 40(3), 679–709 (2018). https://doi.org/10.1007/s00291-018-0522-6

    Article  MathSciNet  Google Scholar 

  15. Hulshof, P.J.H., Kortbeek, N., Boucherie, R.J., Hans, E.W., Bakker, P.J.M.: 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–175 (2012). https://doi.org/10.1057/hs.2012.18

    Article  Google Scholar 

  16. Masterson, B.J., Mihara, T.G., Miller, G., Randolph, S.C., Forkner, M.E., Crouter, A.L.: Using models and data to support optimization of the military health system: a case study in an intensive care unit. Health Care Man Sci. 7(3), 217–224 (2004). https://doi.org/10.1023/B:HCMS.0000039384.92373.c4

    Article  Google Scholar 

  17. Range, T.M., Lusby, R.M., Larsen, J.: A column generation approach for solving the patient admission scheduling problem. Eur. J. Oper. Res. 235(1), 252–264 (2014)

    Article  MATH  Google Scholar 

  18. Roth, A.V., van Dierdonck, R.: Hospital resource planning: concepts, feasibility, and framework. Prod. Oper. Manag. 4(1), 2–29 (1995)

    Article  Google Scholar 

  19. Schmidt, R., Geisler, S., Spreckelsen, C.: Decision support for hospital bed management using adaptable individual length of stay estimations and shared resources. BMC Med. Inform. Decis. Making 13(1), 1–19 (2013)

    Article  Google Scholar 

  20. Vancroonenburg, W., Croce, F.D., Goossens, D., Spieksma, F.C.R.: The red-blue transportation problem. Eur. J. Oper. Res. 237(3), 814–823 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  21. Vancroonenburg, W., De Causmaecker, P., Spieksma, F.C.R., Berghe, G.V.: Scheduling elective patient admissions considering room assignment and operating theatre capacity constraints. In: Proceedings of the 5th International Conference on Applied Operational Research. Lecture Notes in Management Science vol. 5, pp. 153–158 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sigrid Knust .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Brandt, T., Büsing, C., Knust, S. (2022). One Transfer per Patient Suffices: Structural Insights About Patient-to-Room Assignment. In: Ljubić, I., Barahona, F., Dey, S.S., Mahjoub, A.R. (eds) Combinatorial Optimization. ISCO 2022. Lecture Notes in Computer Science, vol 13526. Springer, Cham. https://doi.org/10.1007/978-3-031-18530-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-18530-4_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-18529-8

  • Online ISBN: 978-3-031-18530-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics