门诊检查顺序动态规划模型仿真研究

Simulation Study on Dynamic Programming Model of Outpatient Examination Sequence

目的基于排队论理论,为医院门诊患者同一天的多个检查项目动态规划其顺序,以使患者完成全部项目的时间最少,缩短患者在医院的逗留时间。方法根据医院的实际情况进行仿真实验,通过考虑各科室的排队人数、平均服务时间、路程等信息,设计4种排队策略进行对比分析,从而确定最优的排队方案。结果考虑排队等待时间、服务时间以及通往科室途中即将到达的潜在患者数的方案一,较其他排队方案更优。结论不同排队策略会影响患者在医院的逗留时间,通过合理规划检查顺序,可以有效减少患者的逗留时间,提高患者满意度。

Objective Based on the queuing theory, the sequence of multiple examination items on the same day for outpatients in the hospital is dynamically programmed, so as to minimize the time for patients to complete all the items and reduce their waiting time in the hospital. Methods According to the actual situation of the hospital, a simulation experiment was conducted. Four queuing strategies were designed for comparative analysis by taking into account the queuing number, average service time, distance and other information of each department, so as to determine the optimal queuing scheme. Results The scheme which considers the waiting time, service time and the number of potential patients arriving on the way to the department is better than other schemes. Conclusion Different queuing strategies will affect the patients’ stay in the hospital. By reasonably planning the sequence of examination, the patients’ length of stay can be effectively reduced and the their satisfaction can be improved.