Operating room (OR) surgery scheduling is a challenging combinatorial optimization problem that determines the operation start time of every surgery to be performed in different surgical groups, as well as the resources assigned to each surgery over a schedule period. One of the main challenges in health care systems is to deliver the highest quality of care at the lowest cost. In real-life situations, there is significant uncertainty in several of the activities involved in the delivery of surgical care, including the duration of the surgical procedures. This paper tackles the operating room surgery scheduling problem with uncertain surgery durations, where uncertainty in surgery durations is represented by means of fuzzy numbers. The problem can be considered as a Fuzzy Flexible Job-shop Scheduling Problem (FFJSP) due to similarities between operating room surgery scheduling with uncertain surgery durations and a multi-resource constraint flexible job-shop scheduling problem with uncertain processing times. This research handles both the advanced and allocation scheduling problems simultaneously and provides an Ant Colony Optimization (ACO) metaheuristic algorithm which utilized a two-level ant graph to integrate sequencing jobs and allocating resources at the same time. To assess the performance of the proposed method, a computational study on five test surgery cases is presented, considering both deterministic and fuzzy surgery durations to enhance the significance of the study. The results of this experiment demonstrated the effectiveness of the proposed metaheuristic algorithm.

中文翻译：

---

基于聚类抗性基因类似物的辣椒辣椒疫霉抗性标记的开发

手术室（OR）手术计划是一个具有挑战性的组合优化问题，它决定了要在不同手术组中执行的每项手术的手术开始时间，以及在计划期内分配给每项手术的资源。卫生保健系统的主要挑战之一是以最低的成本提供最高质量的保健。在现实生活中，提供手术护理所涉及的若干活动（包括手术过程的持续时间）存在很大的不确定性。本文解决了手术时间不确定的手术室手术安排问题，其中手术时间的不确定性由模糊数表示。由于具有不确定手术持续时间的手术室手术调度与具有不确定处理时间的多资源约束柔性作业车间调度问题之间的相似性，该问题可以被视为模糊柔性作业车间调度问题（FFJSP）。这项研究同时处理高级和分配调度问题，并提供了一种蚁群优化（ACO）元启发式算法，该算法利用了两级蚂蚁图来整合排序作业和同时分配资源。为了评估所提出方法的性能，针对五个测试手术病例进行了计算研究，同时考虑了确定性手术时间和模糊手术时间，以增强研究的重要性。