带负顾客和非空竭服务随机休假的M^([x])/G/1可修排队系统  

AN M^([X])/G/1 REPAIRABLE QUEUEING SYSTEM WITH NEGATIVE CUSTOMERS AND RANDOM VACATION ON NON-EXHAUSTIVE SERVICE

作　　者：吴锦标[1] 刘再明[1] 彭懿[2] 

机构地区：[1]中南大学数学科学与计算技术学院,长沙410075 [2]湖南师范大学数学与计算机科学学院,长沙410081

出　　处：《系统科学与数学》2010年第3期303-314,共12页Journal of Systems Science and Mathematical Sciences

基　　金：国家自然科学基金(10971230);湖南省研究生创新基金(3340-74236000001);中南大学研究生学位论文创新基金(3960-71131100003)资助项目

摘　　要：研究了带负顾客和非空竭服务随机休假的M^([X])/G/1可修排队系统.负顾客不仅仅移除一个正在接受服务的正顾客,而且还使得服务器损坏而立即进行修理.通过构造一个具有吸收态的马尔可夫链求得了系统稳态存在的充分必要条件.利用补充变量法求得了系统的排队指标和可靠性指标.最后我们还给出了一个数值实例.This paper considers an M^[X]/G/1 queue with negative customers and random vacation on non-exhaustive service subject to the server breakdowns and repairs. Negative customers not only remove the customer being in service, but also make the server under repair. The necessary and sufficient condition for the system stability is obtained by constructing a Markov chain with a absorb state. The queue and the main reliability indices of server are derived with the method of supplementary variables. At last a numerical example is given.

关 键 词：随机运筹学 可修排队系统 负顾客 随机休假 马尔可夫链 

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