Patient-to-room assignment with single-rooms entitlements: Combinatorial insights and integer programming formulations

Patient-to-room assignment (PRA) is a scheduling problem in decision support for hospitals. It consists of assigning patients to rooms during their stay at a hospital according to certain conditions and objectives, e.g., ensuring gender separated rooms, avoiding transfers and respecting single-room...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 325; číslo 1; s. 20 - 37
Hlavní autoři: Brandt, Tabea, Büsing, Christina, Engelhardt, Felix
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 16.08.2025
Témata:
Binary integer programming
Combinatorial optimisation
Dynamic planning
Hospital bed management
Patient admission scheduling
Patient-to-room assignment
Patient admission scheduling
Patient-to-room assignment
Combinatorial optimisation
Hospital bed management
Binary integer programming
Dynamic planning
ISSN:0377-2217
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Patient-to-room assignment (PRA) is a scheduling problem in decision support for hospitals. It consists of assigning patients to rooms during their stay at a hospital according to certain conditions and objectives, e.g., ensuring gender separated rooms, avoiding transfers and respecting single-room requests. This work presents combinatorial insights about the feasibility of PRA and about how (many) single-room requests can be respected. We further compare different integer programming (IP) formulations for PRA as well as the influence of different objectives on the runtime using real-world data. Based on these results, we develop a fast IP-based solution approach, which obtains high quality solutions. In contrast to previous IP-formulations, the results of our computational study indicate that large, real-world instances can be solved to a high degree of optimality within (fractions of) seconds. We support this result by a computational study using a large set of realistic but randomly generated instances with 50% to 95% capacity utilisation. •Insights about real-life patient-to-room assignment (PRA) in German hospitals.•Hands-on formula for checking an instance’s feasibility.•Efficient computation of the number of fulfillable single-room requests.•Exact solution approach for PRA evaluated on real-life data.•Efficient BIP-based heuristic obtains high quality solution for dynamic PRA.
ISSN:0377-2217
DOI:10.1016/j.ejor.2025.02.018