Surgical Scheduling with Constrained Patient Waiting Times

We consider a surgical case scheduling problem with the objective of minimizing the expected time span of the schedule subject to a prespecified upper bound on the expected waiting time for each patient. The problem is challenging due to its combinatorial and nonlinear nature, and we focus on developing approximate methods to solve the problem. Specifically, we study two approximation methods. In the certainty equivalent method, we approximate …