A Decomposition Algorithm for the Two-Stage Chance-Constrained Operating Room Scheduling Problem

• Main Authors: Amirhossein Najjarbashi, Gino J. Lim
• Format: Article
• Language: English
• Published: IEEE 2020-01-01
• Series: IEEE Access
• Subjects: Chance constraints; mixed-integer programming; operating room scheduling; two-stage stochastic programming; uncertainty
• Online Access: https://ieeexplore.ieee.org/document/9079829/

The required time for surgical interventions in operating rooms (OR) may vary significantly from the predicted values depending on the type of operations being performed, the surgical team, and the patient. These deviations diminish the efficient utilization of OR resources and result in the disruption of projected surgery start times. This paper proposes a two-stage chance-constrained model to solve the OR scheduling problem under uncertainty. The goal is to minimize the costs associated with OR opening and overtime as well as reduce patient waiting times. The risk of OR overtime is controlled using chance constraints. Numerical experiments show that the proposed model provides a better trade-off between minimizing costs and reducing solution variability when compared to two existing models in the literature. It is also shown that the three models converge as the overtime probability threshold approaches one. Moreover, it is observed that the individual chance constraints result in the opening of fewer rooms, lower waiting times, and shorter solution times when compared to that of joint chance constraints. A decomposition algorithm is applied that solves large test instances of the OR scheduling problem, that of which is known to be NP-hard. Strong valid inequalities are derived in order to accelerate the convergence speed. The proposed approach outperformed both a commercial solver and a basic decomposition algorithm after solving all test instances with up to 89 surgeries and 20 ORs in less than 48 minutes.