Offline Patient Admission, Room and Surgery Scheduling Problems
Patient admission and surgery scheduling is a complex combinatorial optimization problem. It consists on defining patient admission dates, assigning them to suitable rooms, and schedule surgeries accordingly to an existing master surgical schedule. This problem belongs to the class of NP-hard problems. In this paper, we firstly formulate an integer programming model for offline patient admissions, room assignments, and surgery scheduling; then apply a matheuristic that combines exact methods with rescheduling approaches. The matheuristic is evaluated using benchmark datasets. The experimental results improve those reported in the literature and show that the proposed method outperforms existing techniques of the state-of-the-arts.
KeywordsCombinatorial optimization Patient admission scheduling Surgery scheduling Matheuristic
We would like to thank Eugenio Rende who created a tool for computing input cost matrices.
- 7.Guido, R., Solina, V., Conforti, D.: Offline Patient Admission Scheduling Problems. In: Sforza A., Sterle C. (eds) Optimization and Decision Science: Methodologies and Applications. ODS 2017. Springer Proceedings in Mathematics & Statistics, vol 217. Springer, Cham (2017)Google Scholar