New heuristics for planning operating rooms.

J.M. Molina-Pariente, Elias W. Hans, J.M. Framinan, T. Gomez-Cia

Research output: Contribution to journalArticleAcademicpeer-review

11 Citations (Scopus)

Abstract

We tackle the operating room planning problem of the Plastic Surgery and Major Burns Specialty of the University Hospital “Virgen del Rocio” in Seville (Spain). The decision problem is to assign an intervention date and an operating room to a set of surgeries on the waiting list, minimizing access time for patients with diverse clinical priority values. This problem has been previously addressed in the literature considering different objective functions. The clinical priority depends on the surgery priority and the number of days spent on the waiting list. We propose a set of 83 heuristics (81 constructive heuristics, a composite heuristic, and a meta-heuristic) based on a new solution encoding, and we compare these methods against existing heuristics from the literature for solving operating room planning problems. The heuristics are adapted to the problem under consideration (i.e. considering all constraints and the new objective function), being re-implemented using the information provided by the authors. In total, after a calibration procedure, we compare 17 heuristics. The computational experiments show that our proposed meta-heuristic is the best for the problem under consideration. Finally, the proposed heuristics are tested using data from the Plastic Surgery and Major Burns Specialty. The results show significant improvements on several key performance indicators (number of scheduled surgeries, quality of surgical plan, resources utilization, etc.) when comparing with the actual results obtained by the specialty in the current practice. The aforementioned hospital is currently implementing the heuristic methods.
Original languageUndefined
Pages (from-to)429-443
Number of pages15
JournalComputers and industrial engineering
Volume90
DOIs
Publication statusPublished - 2015

Keywords

  • METIS-316508
  • IR-100410

Cite this

Molina-Pariente, J.M. ; Hans, Elias W. ; Framinan, J.M. ; Gomez-Cia, T. / New heuristics for planning operating rooms. In: Computers and industrial engineering. 2015 ; Vol. 90. pp. 429-443.
@article{5e3e13a1f9854718bc2a226ce7841605,
title = "New heuristics for planning operating rooms.",
abstract = "We tackle the operating room planning problem of the Plastic Surgery and Major Burns Specialty of the University Hospital “Virgen del Rocio” in Seville (Spain). The decision problem is to assign an intervention date and an operating room to a set of surgeries on the waiting list, minimizing access time for patients with diverse clinical priority values. This problem has been previously addressed in the literature considering different objective functions. The clinical priority depends on the surgery priority and the number of days spent on the waiting list. We propose a set of 83 heuristics (81 constructive heuristics, a composite heuristic, and a meta-heuristic) based on a new solution encoding, and we compare these methods against existing heuristics from the literature for solving operating room planning problems. The heuristics are adapted to the problem under consideration (i.e. considering all constraints and the new objective function), being re-implemented using the information provided by the authors. In total, after a calibration procedure, we compare 17 heuristics. The computational experiments show that our proposed meta-heuristic is the best for the problem under consideration. Finally, the proposed heuristics are tested using data from the Plastic Surgery and Major Burns Specialty. The results show significant improvements on several key performance indicators (number of scheduled surgeries, quality of surgical plan, resources utilization, etc.) when comparing with the actual results obtained by the specialty in the current practice. The aforementioned hospital is currently implementing the heuristic methods.",
keywords = "METIS-316508, IR-100410",
author = "J.M. Molina-Pariente and Hans, {Elias W.} and J.M. Framinan and T. Gomez-Cia",
year = "2015",
doi = "10.1016/j.cie.2015.10.002",
language = "Undefined",
volume = "90",
pages = "429--443",
journal = "Computers and industrial engineering",
issn = "0360-8352",
publisher = "Elsevier",

}

New heuristics for planning operating rooms. / Molina-Pariente, J.M.; Hans, Elias W.; Framinan, J.M.; Gomez-Cia, T.

In: Computers and industrial engineering, Vol. 90, 2015, p. 429-443.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - New heuristics for planning operating rooms.

AU - Molina-Pariente, J.M.

AU - Hans, Elias W.

AU - Framinan, J.M.

AU - Gomez-Cia, T.

PY - 2015

Y1 - 2015

N2 - We tackle the operating room planning problem of the Plastic Surgery and Major Burns Specialty of the University Hospital “Virgen del Rocio” in Seville (Spain). The decision problem is to assign an intervention date and an operating room to a set of surgeries on the waiting list, minimizing access time for patients with diverse clinical priority values. This problem has been previously addressed in the literature considering different objective functions. The clinical priority depends on the surgery priority and the number of days spent on the waiting list. We propose a set of 83 heuristics (81 constructive heuristics, a composite heuristic, and a meta-heuristic) based on a new solution encoding, and we compare these methods against existing heuristics from the literature for solving operating room planning problems. The heuristics are adapted to the problem under consideration (i.e. considering all constraints and the new objective function), being re-implemented using the information provided by the authors. In total, after a calibration procedure, we compare 17 heuristics. The computational experiments show that our proposed meta-heuristic is the best for the problem under consideration. Finally, the proposed heuristics are tested using data from the Plastic Surgery and Major Burns Specialty. The results show significant improvements on several key performance indicators (number of scheduled surgeries, quality of surgical plan, resources utilization, etc.) when comparing with the actual results obtained by the specialty in the current practice. The aforementioned hospital is currently implementing the heuristic methods.

AB - We tackle the operating room planning problem of the Plastic Surgery and Major Burns Specialty of the University Hospital “Virgen del Rocio” in Seville (Spain). The decision problem is to assign an intervention date and an operating room to a set of surgeries on the waiting list, minimizing access time for patients with diverse clinical priority values. This problem has been previously addressed in the literature considering different objective functions. The clinical priority depends on the surgery priority and the number of days spent on the waiting list. We propose a set of 83 heuristics (81 constructive heuristics, a composite heuristic, and a meta-heuristic) based on a new solution encoding, and we compare these methods against existing heuristics from the literature for solving operating room planning problems. The heuristics are adapted to the problem under consideration (i.e. considering all constraints and the new objective function), being re-implemented using the information provided by the authors. In total, after a calibration procedure, we compare 17 heuristics. The computational experiments show that our proposed meta-heuristic is the best for the problem under consideration. Finally, the proposed heuristics are tested using data from the Plastic Surgery and Major Burns Specialty. The results show significant improvements on several key performance indicators (number of scheduled surgeries, quality of surgical plan, resources utilization, etc.) when comparing with the actual results obtained by the specialty in the current practice. The aforementioned hospital is currently implementing the heuristic methods.

KW - METIS-316508

KW - IR-100410

U2 - 10.1016/j.cie.2015.10.002

DO - 10.1016/j.cie.2015.10.002

M3 - Article

VL - 90

SP - 429

EP - 443

JO - Computers and industrial engineering

JF - Computers and industrial engineering

SN - 0360-8352

ER -