考虑患者选择和公平性的序列预约调度方法

发布时间：2018-06-25 08:12

本文选题：医疗预约调度 + 医疗运作管理　；参考：《系统工程学报》2014年01期

【摘要】：有效的预约调度系统对于提高医疗系统的服务效率和患者的满意度至关重要.通常医护人员需要将每个患者安排到一个可行的时间段内,该预约时刻确定后便不可以随时更改.本文考虑带有公平性约束和患者选择的预约调度问题,允许患者和医护人员协商确定双方都认可的预约服务时间,患者的公平性描述为各个时段平均等待时间的差.本文基于指数分布服务时间提出了一种精确的序列算法,确定每天最优的预约患者数量以及预约时段以最大化医院的收益.数值实验验证了目标函数的单峰性,并分析了系统的性能指标及影响因素.
[Abstract]:An effective reservation scheduling system is very important to improve the service efficiency and patient satisfaction of the medical system. Usually, health care workers need to arrange each patient within a feasible time frame, and the appointment can not be changed at any time after the appointment is confirmed. In this paper, we consider the scheduling problem with fairness constraints and patient selection, and allow patients and health care personnel to negotiate and determine the time of appointment agreed by both parties. The fairness of patients is described as the difference of the average waiting time in each period. This paper presents an accurate sequential algorithm based on exponential distribution of service time to determine the optimal number of patients per day and the period of appointment to maximize hospital revenue. The single peak of the objective function is verified by numerical experiments, and the performance index and influencing factors of the system are analyzed.
【作者单位】：东北大学流程工业综合自动化国家重点实验室;
【基金】：国家创新研究群体科学基金资助项目(71021061)
【分类号】：C934;R197.3

【参考文献】