本文選題：醫(yī)療預(yù)約調(diào)度 + 醫(yī)療運(yùn)作管理��； 參考：《系統(tǒng)工程學(xué)報(bào)》2014年01期

【摘要】：有效的預(yù)約調(diào)度系統(tǒng)對(duì)于提高醫(yī)療系統(tǒng)的服務(wù)效率和患者的滿(mǎn)意度至關(guān)重要.通常醫(yī)護(hù)人員需要將每個(gè)患者安排到一個(gè)可行的時(shí)間段內(nèi),該預(yù)約時(shí)刻確定后便不可以隨時(shí)更改.本文考慮帶有公平性約束和患者選擇的預(yù)約調(diào)度問(wèn)題,允許患者和醫(yī)護(hù)人員協(xié)商確定雙方都認(rèn)可的預(yù)約服務(wù)時(shí)間,患者的公平性描述為各個(gè)時(shí)段平均等待時(shí)間的差.本文基于指數(shù)分布服務(wù)時(shí)間提出了一種精確的序列算法,確定每天最優(yōu)的預(yù)約患者數(shù)量以及預(yù)約時(shí)段以最大化醫(yī)院的收益.數(shù)值實(shí)驗(yàn)驗(yàn)證了目標(biāo)函數(shù)的單峰性,并分析了系統(tǒng)的性能指標(biāo)及影響因素.
[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.
【作者單位】： 東北大學(xué)流程工業(yè)綜合自動(dòng)化國(guó)家重點(diǎn)實(shí)驗(yàn)室;
【基金】：國(guó)家創(chuàng)新研究群體科學(xué)基金資助項(xiàng)目(71021061)
【分類(lèi)號(hào)】：C934;R197.3

【參考文獻(xiàn)】

相關(guān)期刊論文 前1條

1 朱寧;馬壽峰;康迪;;基于狀態(tài)依賴(lài)排隊(duì)模型的車(chē)輛疏散問(wèn)題研究[J];系統(tǒng)工程學(xué)報(bào);2012年06期

【共引文獻(xiàn)】

相關(guān)期刊論文 前2條

1 王聰;劉子先;;基于DRGs與模糊需求的醫(yī)療服務(wù)資源分配優(yōu)化[J];工業(yè)工程;2013年06期

2 宓軼群;陳s，

本文編號(hào)：2065262