Article ID: | iaor20134962 |
Volume: | 25 |
Issue: | 4 |
Start Page Number: | 682 |
End Page Number: | 692 |
Publication Date: | Sep 2013 |
Journal: | INFORMS Journal on Computing |
Authors: | Schaefer Andrew J, Shylo Oleg V, Prokopyev Oleg A |
Keywords: | hospitals, stochastic scheduling, mixed integer programming |
Scheduling elective procedures in an operating suite is a formidable task because of competing performance metrics and uncertain surgery durations. In this paper, we present an optimization framework for batch scheduling within a block booking system that maximizes the expected utilization of operating room resources subject to a set of probabilistic capacity constraints. The algorithm iteratively solves a series of mixed‐integer programs that are based on a normal approximation of cumulative surgery durations. This approximation is suitable for high‐volume medical specialities but might not be acceptable for the specialties that perform few procedures per block. We test our approach using the data from the ophthalmology department of the Veterans Affairs Pittsburgh Healthcare System. The performance of the schedules obtained by our approach is significantly better than schedules produced by simple heuristic scheduling rules.