摘要
本文设计的一个新的住院病床安排方案,可用来取代传统的FCFS(先到先得)规则。患者在等候队列中的优先级将基于病情和手术的紧急程度。本文把患者的入住情况转化为经典的M/M/N排队论问题,利用可逆Q-过程的性质以及经典排队论的结果,得到各类疾病患者的平均逗留时间以及所需床位数的先验估计。根据独立Poisson过程的性质确定排队过程的Q-矩阵,从而作出相应的先验估计和具体表达式。在若干约束条件的基础上,利用C++编程求得最优病床分配方案。本文建立的评价指标体系,通过计算机随机模拟,证明了在多种情形下,该模型较FCFS(先到先得)规则更具优势。
A new optimization plan for the arrangement of hospital bed is conceived to replace the traditional FCFS rule.The priority of the patients in a queue is determined by the category of disease and the urgency of operation.First we adopt M/M/N queuing theory and the theory of Q-process to obtain a prior estimation of the average treatment time and average patient flow of different diseases.The Q-matrix is calculated based on the property of independent Poisson process.Finally,the parameters of the arrangement plan is determined by C＋＋ programming.In this article,we also devise an evaluation method,and by stochastic simulation we show that our method excels the FCFS rule under various circumstances.
出处
《运筹与管理》
CSCD
北大核心
2011年第3期92-100,共9页
Operations Research and Management Science
关键词
运筹学
模型
排队论
病床安排
Q-过程
随机模拟
operations research
model
queuing theory
hospital bed arrangement
Q-process
stochastic simulation
