Stochastic Optimization Approaches for an Operating Room and Anesthesiologist Scheduling Problem

Abstract

Improving Operating Room, Surgery, and Anesthesiologist Scheduling Using Stochastic and Robust Optimization Efficient planning and scheduling of operating room (OR) activities is crucial for managing costs and delivering high-quality surgical care. However, this task is extremely complex for several reasons. First, it requires coordinating multiple resources, such as ORs and anesthesiologists. Second, in addition to limited OR capacity and time, there is a significant shortage of anesthesiologists required to perform surgeries. Third, surgery durations are uncertain and difficult to predict. Ignoring such uncertainty may lead to substantial overtime, idling, and surgery delays, among other schedule deficiencies. Thus, hospital managers could benefit greatly from advanced methodologies to improve OR utilization, surgical care, and quality as well as to minimize OR operational costs. In “Stochastic Optimization Approaches for an Operating Room and Anesthesiologist Scheduling Problem,” M. Y. Tsang, K. S. Shehadeh, F. E. Curtis, B.R. Hochman, and T. E. Brentjens propose computationally tractable stochastic programming and distributionally robust optimization methodologies for an integrated allocation, assignment, sequencing, and scheduling problem under uncertainty involving multiple ORs, anesthesiologists, and surgery types. Using real-world surgery data and a case study from a health system in New York, they conduct extensive experiments demonstrating the computational efficiency of the proposed methodologies, allowing for their implementation in practice. Moreover, they show the negative consequences of adopting the existing non-integrated approaches and provide valuable practical insights.