guest ::
TY - THES AU - Brandt, Tabea Claudia TI - Structural insights and efficient algorithms for the patient-to-room assignment problem with equal rooms PB - RWTH Aachen University VL - Dissertation CY - Aachen M1 - RWTH-2025-06846 SP - 1 Online-Ressource : Illustrationen PY - 2025 N1 - Veröffentlicht auf dem Publikationsserver der RWTH Aachen University N1 - Dissertation, RWTH Aachen University, 2025 AB - Hospitals are an essential part of our health care system and provider of critical services. Currently, most hospitals face serious challenges due to staff shortage or a tight budget. Efficient planning is therefore essential in every day life of hospitals. However, many planning tasks are still performed manually by experienced medical staff which takes up valuable time. One of those every-day tasks for which no automated planning or decision support exists is the assignment of patients to rooms. This so-called patient-to-room assignment problem (PRA) is a fundamental task in hospitals and, especially, within wards. 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, respecting single-room requests, and finding suitable roommates. Over the last years, many heuristics have been proposed for PRA with a large variety of different practical constraints. However, a thorough investigation of the problem’s structure itself has been neglected so far. Additionally, the setting mostly considered in literature does not fit well to the common situation in German hospitals. In this thesis, we present insights about the basic, underlying combinatorial problem of PRA with a focus on the setting of our local hospitals. We complement our combinatorial insights with an efficient solution approach for PRA that solves real-world instances to a high degree of optimality within seconds. LB - PUB:(DE-HGF)11 DO - DOI:10.18154/RWTH-2025-06846 UR - https://publications.rwth-aachen.de/record/1016252 ER -