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 available on the web along with our solutions and the validator. Finally, we perform an extensive experimental evaluation of our solution method including statistically principled parameter tuning and an analysis of some features of the model and their corresponding impact on the objective function.
KeywordsPatient admission scheduling Patient bed assignment Operating rooms Local search
- Birattari, M. (2004). The problem of tuning metaheuristics as seen from a machine learning perspective. PhD thesis, Université Libre de Bruxelles, Belgium.Google Scholar
- Blake, J. T., & Carter, M. W. (1997). Surgical process scheduling: a structured review. Journal of the Society for Health Systems, 5(3), 17–30.Google Scholar
- Demeester, P. (2009). Patient admission scheduling website. http://allserv.kahosl.be/peter/pas/. Accessed 24 September 2013.
- Hans, E.W., & Vanberkel, P.T. (2012). Operating theatre planning and scheduling. In: Handbook of healthcare system Scheduling, vol 168, Springer, chap 5, pp 105–130.Google Scholar
- Hutzschenreuter, AK., Bosman, PAN., Blonk-Altena, I., van Aarle, J., & La Poutré, H. (2008). Agent-based patient admission scheduling in hospitals. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems: Industrial Track, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, AAMAS ’08, pp 45–52.Google Scholar
- Min, D., & Yih, Y. (2010a). An elective surgery scheduling problem considering patient priority. Computers & Operations Research, 37(6), 1091–1099.Google Scholar
- Vancroonenburg, W., De Causmaecker, P., & Vanden Berghe, G. (2012). Patient-to-room assignment planning in a dynamic context. In: Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT-2012), pp 193–208.Google Scholar
- Vancroonenburg, W., De Causmaecker, P., Spieksma, F., & Vanden Berghe, G. (2013). Scheduling elective patient admissions considering room assignment and operating theatre capacity constraints. In: Proceedings of the 5th International Conference on Applied Operational Research, Lecture Notes in Management Science, vol 5, pp 153–158.Google Scholar