Dynamic Care Unit Placements Under Unknown Demand with Learning

Problem definition : Care units are the facilities where admitted hospital patients receive treatment and monitoring services. This paper studies the problem of deciding which patients to place into the various available care units at any time. To determine placements in practice, hospitals rely on clinicians to discern a patient’s care needs and appropriately trade-off between future demand and limited bed availability. Making the right decisions remains challenging because patients are heterogeneous, and demand is uncertain. Methodology/results : We develop a dynamic resource allocation algorithm to decide unit placements by learning the care needs of different patient types. We model hospital beds as reusable resources and assume decision feedback is not immediately available, but rather delayed for an unknown and random length of time. Lastly, we consider the demand to be unknown and allow patient arrivals to be arbitrarily sequenced for robustness. The applicability of our algorithm is demonstrated with real-patient data from a hospital collaboration, where we evaluate our proposed approach using unplanned readmission rates as the performance metric. From extensive simulations, our results suggest the proposed algorithm tends to outperform several greedy benchmarks as well as a hospital benchmark model. A theoretical performance guarantee for our algorithm is provided to complement the case study. Managerial implications : This paper contributes new insights into designing dynamic decision-making models for hospital admissions operations. Our work presents a simple but effective data-driven support tool to help clinicians trade-off between available bed capacity and a patient’s care needs when making care unit placements. We also demonstrate how our algorithm can support the reduction of unplanned readmissions through improved placement decisions.