dc.creatorDuran, Guillermo Alfredo
dc.creatorRey, Pablo A.
dc.creatorWolff, Patricio
dc.date.accessioned2018-08-15T19:37:28Z
dc.date.accessioned2018-11-06T11:31:19Z
dc.date.available2018-08-15T19:37:28Z
dc.date.available2018-11-06T11:31:19Z
dc.date.created2018-08-15T19:37:28Z
dc.date.issued2017-11
dc.identifierDuran, Guillermo Alfredo; Rey, Pablo A.; Wolff, Patricio; Solving the operating room scheduling problem with prioritized lists of patients; Springer; Annals Of Operations Research; 258; 2; 11-2017; 395-414
dc.identifier0254-5330
dc.identifierhttp://hdl.handle.net/11336/55732
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1854058
dc.description.abstractThe 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.
dc.languageeng
dc.publisherSpringer
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/https://dx.doi.org/10.1007/s10479-016-2172-x
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007%2Fs10479-016-2172-x
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectEXHAUSTIVE ENUMERATION
dc.subjectINTEGER PROGRAMMING
dc.subjectOPERATING ROOM
dc.subjectPATIENT PRIORITY
dc.titleSolving the operating room scheduling problem with prioritized lists of patients
dc.typeArtículos de revistas
dc.typeArtículos de revistas
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución