Offline Patient Admission, Room and Surgery Scheduling Problems

  • Rosita GuidoEmail author
  • Vittorio Solina
  • Giovanni Mirabelli
  • Domenico Conforti
Part of the AIRO Springer Series book series (AIROSS, volume 1)


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.


Combinatorial optimization Patient admission scheduling Surgery scheduling Matheuristic 



We would like to thank Eugenio Rende who created a tool for computing input cost matrices.


  1. 1.
    Hulshof, P., Kortbeek, N., Boucherie, R., Hans, E., Bakker, P.: Taxonomic classification of planning decisions in health care: a structured review of the state of the art in OR/MS. Health Syst. 1, 129–175 (2012)CrossRefGoogle Scholar
  2. 2.
    Demeester, P., Souffriau, W., De Causmaecker, P., Vanden Berghe, G.: A hybrid tabu search algorithm for automatically assigning patients to beds. Artif. Intell. Med. 48(1), 61–70 (2010)CrossRefGoogle Scholar
  3. 3.
    Ceschia, S., Schaerf, A.: Local search and lower bounds for the patient admission scheduling problem. Comput. Op. Res. 10(38), 1452–1463 (2011)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Ceschia, S., Schaerf, A.: Modeling and solving the patient admission scheduling problem under uncertainty. Artifi. Intell. Med. 56(3), 199–205 (2012)CrossRefGoogle Scholar
  5. 5.
    Ceschia, S., Schaerf, A.: Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays. J. Sched. 19(4), 377–389 (2016)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Vancroonenburg, W., Della Croce, F., Goossens, D., Spieksma, F.C.R.: The red blue transportation problem. Eur. J. Op. Res. 237(3), 814–823 (2014)MathSciNetCrossRefGoogle Scholar
  7. 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
  8. 8.
    Lusby, R.M., Schwierz, M., Range, T.M., Larsen, J.: An adaptive large neighborhood search procedure applied to the dynamic patient admission scheduling problem. Artif. Intell. Med. 74, 21–31 (2016)CrossRefGoogle Scholar
  9. 9.
    Guido, R., Groccia, M.C., Conforti, D.: An efficient matheuristic for offline patient-to-bed assignment problems. Eur. J. Op. Res. 268(2), 486–503 (2018)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Rosita Guido
    • 1
    Email author
  • Vittorio Solina
    • 1
  • Giovanni Mirabelli
    • 2
  • Domenico Conforti
    • 1
  1. Lab, Department of Mechanical, Energy and Management EngineeringUniversity of CalabriaRendeItaly
  2. 2.Department of Mechanical, Energy and Management EngineeringUniversity of CalabriaRendeItaly

Personalised recommendations