The Operating Room Scheduling (ORS) problem is the task of assigning patients to operating rooms, taking into account different specialties, lengths and priority scores of each planned surgery, operating room session durations, and the availability of beds for the entire length of stay both in the Intensive Care Unit and in the wards. A proper solution to the ORS problem is of primary importance for the healthcare service quality and the satisfaction of patients in hospital environments. In this paper we first present a solution to the problem based on Answer Set Programming (ASP). The solution is tested on benchmarks with realistic sizes and parameters, on three scenarios for the target length on 5-day scheduling, common in small-medium sized hospitals, and results show that ASP is a suitable solving methodology for the ORS problem in such setting. Then, we also performed a scalability analysis on the schedule length up to 15 days, which still shows the suitability of our solution also on longer plan horizons. Moreover, we also present an ASP solution for the rescheduling problem, i.e. when the off-line schedule cannot be completed for some reason. Finally, we introduce a web framework for managing ORS problems via ASP that allows a user to insert the main parameters of the problem, solve a specific instance, and show results graphically in real-time. Under consideration in Theory and Practice of Logic Programming (TPLP).
翻译:手术室排程(ORS)问题是将病人分配到手术室的任务,考虑到每个计划外科手术的不同特点、长度和优先分数、手术室会话的长度和优先分数,以及在密集护理单位和病房内整个停留时间的床位的提供情况,对ORS问题的适当解决办法对保健服务质量和住院病人满意程度至关重要。在本文件中,我们首先根据“应答设定”方案(ASP)提出解决问题的办法。 解决办法的测试基于符合现实要求的大小和参数的基准、5天排程目标长度的三种假设、中小规模医院常见的三种假设,结果显示ASP是解决ORS问题的适当方法。然后,我们还对时间长达15天的时间长度进行了可伸缩性分析,这仍然表明我们的解决办法是否适合更长的计划视野。 此外,我们还提出了一个有一定原因无法完成离线时间和参数的调整问题ASP解决方案。 最后,我们引入了一个网络框架,通过ASP管理具体操作系统安排的用户参数,在具体操作系统化图中显示一个实际操作结果。