考虑实际护士排班约束的手术排程优化

Surgical Operation Scheduling Optimization Under Nurses' Actual Roster Constraints

在考虑完整手术流程及多种资源约束的基础上,手术排程问题为未来一定时期内待执行的手术确定手术开始时间及所分配的资源,对满足病人及时医治及平衡手术室资源都起着相当重要的作用。本文针对医院实际手术室运作中的手术排程问题进一步增加了护士排班的实际多重约束,包括角色、科室、能力等级等,建立了相应的手术排程数学模型。开发了改进蚁群算法,设计了双层嵌套结构及相应的信息素更新策略。通过对其他文献中算例的计算和结果对比,证明了该蚁群算法的求解结果不仅能够满足护士的各项约束,而且在缩短手术完成时间、减少医护人员加班时间和资源平衡性等性能指标的优化上很有优势,提高了研究的实际适用性。

Surgical operation scheduling determines the start time of individual surgical operations and as- signs the required resources to each surgical operation over a schedule period in considering several con- straints related to a complete surgery flow and multiple resources involved. This task plays a decisive role in providing timely treatments for the patients while hospital resource utilization is balanced. To integrate the surgical operation scheduling problem with real-life nurse roster constraints, such as their role, special- ty, qualification, and availability, a mathematical model is proposed and an ant colony optimization （ACO） approach is used to efficiently solve the problem. A two-layer nested ACO structure and relative pheromone updating strategy is designed. A test case from the literature of a daily nurse scheduling prob- lem is presented and the performance of nurse assignments by the AC0 is compared with the method used in the literature. Result shows that the proposed AC0 can satisfy not only nurses＇ various constraints in op- erations research （OR） management, but also achieve good results in shortening the end time, reducing the nurse overtimes and balancing the resource utilization in general.