不定时间下带资源约束的手术室鲁棒调度方法

Robust Scheduling Method for Resource-Constrained Operation Rooms with Uncertain Processing Time

为了有效提高手术室的利用率,降低医院成本,提高病人满意度,提出了不确定手术时间下带资源约束的手术室调度方法.首先对问题域进行了描述,以最小最大遗憾作为决策准则,建立数学规划模型.在此基础上,建立可行调度解策略,结合手术室特有的资源约束条件,建立了基于分散搜索超启发式的手术室调度算法.最后,设计不同问题规模的实验,对算法性能进行了评价和对比分析,实验结果表明了该算法的适用性和有效性.

To improve the efficiency of operating rooms effectively,and to reduce the costs of the hospital and improve the satisfaction of patients,a scheduling method for operation rooms was presented based on a robust scheduling approach for resource-constrained operation rooms with uncertain processing time.First,aproblem domain was described.Then,mathematical programming models were set up with the objective function of minimizing the maximum deviation from the optimal total costs over all possible realizations of the surgery processing time.Besides,based on the descriptions mentioned above,a solving policy for generating feasible scheduling solutions was established.Combining with the specific resource constraints of operating rooms,a scatter search based hyper-heuristic algorithm was built to solve the scheduling problem.Finally,computational experiments were performed on different scale of problems.The performance of the proposed algorithm was evaluated and compared with that of other approaches in the experiments.The results demonstrate that the proposed algorithm is practical and effective.