This article addresses the daily scheduling of surgeries in an operating theatre. The problem consists of a set of surgical operations that have to be scheduled in identical operating rooms. The operations have uncertain durations, require setup activities before and after the surgical act and are assigned to surgeons who have to perform the surgical part. The objective is to find the best sequence of operations in each room in order to minimize the theatre’s opening duration (makespan) and the surgeons’ waiting times. A stochastic mathematical model and a simulated annealing-based algorithm, where the uncertainty is represented using the sample average approximation technique, are provided. An experimental study carried out on real-sized instances shows that the method’s solutions have respectable relative gaps in comparison with lower bounds and optimal solutions.

本文介绍手术室中手术的日常安排。问题包括必须安排在相同手术室中的一组外科手术。这些手术的持续时间不确定，需要在手术之前和之后进行设置活动，并分配给必须执行手术部分的外科医生。目的是在每个房间中找到最佳的手术顺序，以最小化剧院的开放时间（makespan）和外科医生的等待时间。提供了随机数学模型和基于模拟退火的算法，其中不确定性使用样本平均逼近技术表示。