Solving 0–1 semidefinite programs for distributionally robust allocation of surgery blocks


We allocate surgery blocks to operating rooms (ORs) under random surgery durations. Given unknown distribution of the duration of each block, we investigate distributionally robust (DR) variants of two types of stochastic programming models using a moment-based ambiguous set. We minimize the total cost of opening ORs and allocating surgery blocks, while constraining OR overtime via chance constraints and via an expected penalty cost in the objective function, respectively in the two types of models. Following conic duality, we build equivalent 0–1 semidefinite programming (SDP) reformulations of the DR models and solve them using cutting-plane algorithms. For the DR chance-constrained model, we also derive a 0–1 second-order conic programming approximation to obtain less conservative solutions. We compare different models and solution methods by testing randomly generated instances. Our results show that the DR chance-constrained model better controls average and worst-case OR overtime, as compared to the stochastic programming and DR expected-penalty-based models. Our cutting-plane algorithms also outperform standard optimization solvers and efficiently solve 0–1 SDP formulations.

MIDAS Network Members