A Queuing Model of Time Waiting Based on Kidney Transplantation
The paper mainly discusses the waiting time of the kidney transplant problem to establish a M/M/C queuing model based on hierarchy process; the first tier is the classification method of the patient types, the second is grade, allocation policy and other factors of kidney origin concerned in the method. Each tier is structured by one or more M/M/C queuing model. To solve the model, the system is adjusted to be optimized in the service. In this paper, a group of patients are analyzed, the results can be easily generalized to the whole kidney transplantation service system.
Queue Theory Hierarchy Process Infinite Series Difference Equation
Ge RenDong Liu ShengLan DUAN Xiao-dong
School of Science, Dalian Nationalities University, Dalian 116605, China School of Computer and Information Technology, Liaoning Normal University, Dalian 116081, China
国际会议
2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)
广西桂林
英文
1454-1459
2009-06-17（万方平台首次上网日期，不代表论文的发表时间）