Surgery scheduling with recovery resources
Autor: | Mark E. Cowen, Brian T. Denton, Mark P. Van Oyen, Maya Bam |
---|---|
Rok vydání: | 2017 |
Předmět: |
021103 operations research
business.industry 0211 other engineering and technologies Scheduling (production processes) 02 engineering and technology Surgery scheduling Industrial and Manufacturing Engineering 0202 electrical engineering electronic engineering information engineering Medicine Revenue 020201 artificial intelligence & image processing Operations management Delivery system Elective surgery Programming formulation business |
DOI: | 10.6084/m9.figshare.4962827 |
Popis: | Surgical services are large revenue sources that account for a large portion of hospital expenses. Thus, efficient resource allocation is crucial in this system; however, this is a challenging problem, in part due to the interaction of the different stages of the surgery delivery system and the uncertainty of surgery and recovery durations. This article focuses on single-day in-patient elective surgery scheduling considering surgeons, operating rooms (ORs), and the post-anesthesia care unit (recovery). We propose a mixed-integer programming formulation of this problem and then present a fast two-phase heuristic: phase 1 is used for determining the number of ORs to open for the day and surgeon-to-OR assignments, and phase 2 is used for surgical case sequencing. Both phases have provable worst-case performance guarantees and excellent average case performance. We evaluate schedules under uncertainty using a discrete-event simulation model based on data provided by a mid-sized hospital. We show that the fast and easy-to-implement two-phase heuristic performs extremely well, in both deterministic and stochastic settings. The new methods developed reduce the computational barriers to implementation and demonstrate that hospitals can realize substantial benefits without resorting to sophisticated optimization software implementations. |
Databáze: | OpenAIRE |
Externí odkaz: |