Patient-to-room assignment (PRA) is a scheduling problem in decision support for large hospitals. This work proposes Integer Programming (IP) formulations for dynamic PRA, where either full, limited or uncertain information on incoming patients is available. The applicability is verified through a computational study. Results indicate that large, real world instances can be solved to a high degree of optimality within (fractions of) seconds. Furthermore, different objectives are considered to ensure validity across varying practical requirements. So far, previous approaches for IP in PRA have only been applicable for small instances or special cases. Subsequently, we show that the modelling of gender conflicts and transfers are crucial modelling choices that determine whether the corresponding IPs are solvable in reasonable time.
Pdf can be found here: https://arxiv.org/abs/2401.00221