Advertisement

Offline Patient Admission Scheduling Problems

  • Rosita GuidoEmail author
  • Vittorio Solina
  • Domenico Conforti
Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 217)

Abstract

Patient admission scheduling problems consist in deciding which patient to admit and at what time. More complex problems address also bed assignment problems at the same time. The complexity of the problem motivates researchers to design suitable approaches to support bed managers in making decisions. The aim of this paper is to define an efficient model formulation for the offline elective patient admission scheduling problem, which defines admission dates and assigns patients to rooms. Due to the multiobjective nature of the problem, we suggest how to set weight values, used to penalise constraint violations. These values are tested on a set of benchmark instances. Improvements in schedule quality are presented.

Keywords

Patient admission Scheduling Combinatorial optimization 

References

  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.
    Vancroonenburg, W., Della Croce, F., Goossens, D., Spieksma, F.C.R.: The red-blue transportation problem. Eur. J. Oper. Res. 237(3), 814–823 (2014)Google Scholar
  4. 4.
    Ceschia, S., Schaerf, A.: Modeling and solving the patient admission scheduling problem under uncertainty. Artif. Intell. Med. 3(56), 199–205 (2011)zbMATHGoogle Scholar
  5. 5.
    Guido, R., Groccia, M.C., Conforti, D.A.: Matheuristic for offline bed assignment problems. Eur. J. Oper. Res. Under RevisGoogle Scholar
  6. 6.
    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
  7. 7.
    Ceschia, S., Schaerf, A.: Local search and lower bounds for the patient admission scheduling problem. Comput. Oper. Res. 10(38), 1452–1463 (2011)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Rosita Guido
    • 1
    Email author
  • Vittorio Solina
    • 1
  • Domenico Conforti
    • 1
  1. 1.de-Health Lab, Department of Mechanical, Energy and Management EngineeringUniversity of CalabriaRendeItaly

Personalised recommendations