M/G/1非空竭服务休假排队系统随机分解的简化算法  

A Simplified Method of Stochastic Decomposition on A Vocation Queue of M/G/1 Type and Nonexhaustive Service

作　　者：程应松[1] 朱翼隽[2] 

机构地区：[1]南京财经大学数学系,江苏南京210003 [2]江苏大学数学系,江苏镇江212013

出　　处：《运筹与管理》2004年第2期8-12,共5页Operations Research and Management Science

基　　金：江苏省教育厅基金资助(00KJT11003)

摘　　要：本文根据M/G/1非空竭服务休假排队系统稳态队长随机分解的结构特征提出一种统一算法,该方法简洁高效,避免了再生循环方法繁杂的运算。运用该方法得出的结果与已知的用再生循环方法得出的结论一致。并且修正了Levy(1989)关于Bernoulli闸门服务休假排队系统随机分解的一个错误。In this paper a simplified method is offered according to property of stochastic decomposition of M/G/1 type vocation queue with nonexhaustive service. With this method the same result is obtained as the known ones acquired by the regenerative cycle method. A fault is also corrected on the stochastic decomposition of M/G/1 type vocation queue with Bernoulli gated service.

关 键 词：非空竭服务休假排队 随机分解 结构分析法 稳态队长 排队系统 算法 

分 类 号：O226[理学—运筹学与控制论]