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.

Offline Patient Admission, Room and Surgery Scheduling Problems

Guido, Rosita
;
Solina, Vittorio;Mirabelli, Giovanni;Conforti, Domenico
2018

Abstract

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.
978-3-030-00472-9
978-3-030-00473-6
Combinatorial optimization; Patient admission scheduling; Surgery scheduling; Matheuristic
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/20.500.11770/301176
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? ND
social impact