We present a value function-based formulation for solving a two-stage robust optimization model for surgery-to-OR allocation planning where only upper and lower bounds on surgery duration are known. We solve this formulation using a constraint and column generation algorithm and interpret it as an iterative bi-level interdiction game. We derive valid inequalities based in this interpretation and compare the computational performance of this algorithm with the only other exact solution approach in the literature using the data from an academic medical center. The value function-based formulation yields better or similar quality solutions on difficult problem instances with low or intermediate number of surgeries.

我们提出了一种基于价值函数的公式，用于解决两步鲁棒优化模型，用于手术到OR分配计划，其中仅知道手术持续时间的上限和下限。我们使用约束和列生成算法来解决此公式，并将其解释为迭代的双层拦截游戏。我们根据这种解释得出有效的不等式，并使用来自学术医学中心的数据将该算法的计算性能与文献中唯一的其他精确解决方案进行比较。基于价值函数的公式化可在手术数量较少或中等的困难问题情况下提供更好或类似的质量解决方案。