arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2304.13670math.OCcs.CE
收藏

采用第二阶段成本凸代理模型的柔性手术室手术调度

Surgery Scheduling in Flexible Operating Rooms by using a Convex Surrogate Model of Second-Stage Costs

Mohammed Majthoub Almoghrabi, Guillaume Sagnol

AI总结:

针对医院择急诊共用手术室的手术调度问题,提出基于第二阶段成本凸代理模型的两阶段随机规划方法,结合在线贪心策略,大幅降低成本且求解效率远高于样本平均近似方法。

摘要:

我们研究了医院中择期手术与急诊患者共用手术室场景下的择期手术规划问题。该问题可分为两个不同阶段:首先,需选定下一个规划周期内要实施手术的患者子集,并将选定患者分配至手术时段块及暂定起始时间;随后在问题的在线阶段,由决策策略决定如何将急诊患者插入排程,且可能取消已规划的手术。整体目标是最小化成本函数的期望值,该成本函数涵盖患者时段块分配、手术取消、超时、等待时间及空闲时间相关成本。我们将离线问题建模为两阶段随机规划,并证明第二阶段成本可替换为凸分段线性代理模型,该模型可通过预处理步骤计算。由此得到的混合整数规划即使针对超大规模问题实例,也能在短时间内求解。我们还设计了适用于问题在线阶段的贪心策略,并在大量基准实例上,将我们的方法与启发式方法、基于样本平均近似(SAA)的方法进行对比,分析了方法的性能。仿真结果表明,与启发式方法相比,我们的方法最多可将预期成本降低30%,且能在约1分钟内求解含1000名患者的问题;而SAA方法即使仅面对100名患者的问题,也无法在30分钟内得到近似最优解。

英文摘要:

We study the elective surgery planning problem in a hospital with operation rooms shared by elective and emergency patients. This problem can be split in two distinct phases. First, a subset of patients to be operated in the next planning period has to be selected, and the selected patients have to be assigned to a block and a tentative starting time. Then, in the online phase of the problem, a policy decides how to insert the emergency patients in the schedule and may cancel planned surgeries. The overall goal is to minimize the expectation of a cost function representing the assignment of patient to blocks, case cancellations, overtime, waiting time and idle time. We model the offline problem by a two-stage stochastic program, and show that the second-stage costs can be replaced by a convex piecewise linear surrogate model that can be computed in a preprocessing step. This results in a mixed integer program which can be solved in a short amount of time, even for very large instances of the problem. We also describe a greedy policy for the online phase of the problem, and analyze the performance of our approach by comparing it to either heuristic methods or approaches relying on sampling average approximation (SAA) on a large set of benchmarking instances. Our simulations indicate that our approach can reduce the expected costs by as much as 30% compared to heuristic methods and is able to solve problems with $1000$ patients in about one minute, while SAA-approaches fail to obtain near-optimal solutions within 30 minutes, already for $100$ patients.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑