The number and availability of turnover teams may significantly affect the performance of a surgery schedule. We propose a two-stage stochastic integer programming formulation for setting the patient appointment times for surgeries under limited availability of turnover teams. We assume that a surgery schedule has already been created, and study how the schedule may be refined. We consider the durations of surgical operation and turnover to be random variables. The objective is to minimize the competing criteria of expected patient waiting time and operating room idle time. We discuss an implementation of a heuristic to generate near-optimal surgery schedules. We conduct numerical experiments using data from a large hospital. We compare the heuristic with a well-known and practical procedure used in earlier studies for setting patient appointment times for surgeries. Finally, we evaluate the impact of the number of turnover teams into the surgery schedules with respect to performance criteria of interest.

中文翻译：

---

在手术周转队有限的情况下用于预约调度的随机规划方法

周转团队的数量和可用性可能会严重影响手术计划的执行。我们提出了一个两阶段随机整数规划公式，用于在营业额团队有限的情况下为手术设置患者预约时间。我们假设已经制定了手术时间表，并研究如何完善时间表。我们认为手术时间和周转率是随机变量。目的是使预期的患者等待时间和手术室空闲时间的竞争标准最小化。我们讨论了一种启发式方法的实现，以生成接近最佳的手术时间表。我们使用大型医院的数据进行数值实验。我们将启发式方法与早期研究中用于设置手术患者预约时间的众所周知的实用程序进行比较。最后，我们根据感兴趣的绩效标准评估了营业额团队数量对手术时间表的影响。