Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays

We revisit and extend the patient admission scheduling problem, in order to make it suitable for practical applications. The main novelty is that we consider constraints on the utilisation of operating rooms for patients requiring a surgery. In addition, we propose a more elaborate model that includes a flexible planning horizon, a complex notion of patient delay, and new components of the objective function. We design a solution approach based on local search, which explores the search space using a composite neighbourhood. In addition, we develop an instance generator that uses real-world data and statistical distributions so as to synthesise realistic and challenging case studies, which are made avail- able on the web along with our solutions and the validator. Finally, we perform an extensive experimental evaluation of our solution method including statistically principled para- meter tuning and an analysis of some features of the model and their corresponding impact on the objective function.