We model multi-hospital priority-based surgical case scheduling as an integer program.
We develop novel logic-based Benders’ methods to solve our integer program.
We show incorporating both feasibility and optimality cuts expedites convergence.
We show the choice of implementation substantially accelerates convergence.
We show our new cut propagation mechanism leads to faster convergence.