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

Sequential appointment scheduling algorithm considering patient choice and fairness

有效的预约调度系统对于提高医疗系统的服务效率和患者的满意度至关重要.通常医护人员需要将每个患者安排到一个可行的时间段内,该预约时刻确定后便不可以随时更改.本文考虑带有公平性约束和患者选择的预约调度问题,允许患者和医护人员协商确定双方都认可的预约服务时间,患者的公平性描述为各个时段平均等待时间的差.本文基于指数分布服务时间提出了一种精确的序列算法,确定每天最优的预约患者数量以及预约时段以最大化医院的收益.数值实验验证了目标函数的单峰性,并分析了系统的性能指标及影响因素.

Effective appointment system is crucial to improve the efficiency of the clinic and satisfaction of the patients. In practice, the hospital scheduler usually gives the patients an available slot and the appointment time can＇t be adjusted once given. This paper take fairness constraint, which is defined as the difference of maximum and minimum average waiting time among intervals, into consideration, patients＇ choice and inter- action between patients and the scheduler are allowed in the appointment system. A myopic optimal sequential scheduling algorithm is proposed to determine the number of patients arranged in a day as well as the opti- mal scheduled interval, maximizing the total profit of the hospital under the assumption that the service time is exponentially distributed. Numerical results demonstrate the unimodal of the objective function and the performances of the system are analyzed.