Title
Solving the operating room scheduling problem with prioritized lists of patients.
Abstract
The scheduling of surgical interventions directly impacts the number of patients that can be treated with given operating room resources. Medical centres often do not respond satisfactorily to the demand for interventions, and the shortcomings of traditional manual scheduling approaches contribute to the growth of waiting lists. In addition to the timetabling aspect, operating room scheduling methods must determine the order in which patients should be treated as a function of their relative priorities. This paper develops and compares two optimization models and two algorithms for scheduling interventions over a defined period that satisfy patient priority criteria. The four mathematical methods were studied under a range of different scenarios using real data from a public hospital in Chile. Improvements in operating room utilization rates using the proposed formulations ranged from 10 to 15 % over the current manual techniques, but the choice of method in any given real application will depend on the scenarios likely to be encountered.
Year
DOI
Venue
2017
10.1007/s10479-016-2172-x
Annals OR
Keywords
Field
DocType
Operating room, Integer programming, Exhaustive enumeration, Patient priority
Public hospital,Mathematical optimization,Job shop scheduling,Fair-share scheduling,Computer science,Scheduling (computing),Deadline-monotonic scheduling,Integer programming,Rate-monotonic scheduling,Dynamic priority scheduling,Operations management
Journal
Volume
Issue
ISSN
258
2
1572-9338
Citations 
PageRank 
References 
5
0.39
5
Authors
3
Name
Order
Citations
PageRank
Guillermo Durán129629.28
Pablo A. Rey2254.58
Patricio Wolff350.39