On a BMAP/G/1 G-queue with setup times and multiple vacations

被引：7
|
作者：
Peng, Yi [1 ]
Yang, Xiang-qun [2 ]
机构：
[1] Cent S Univ, Sch Math Sci & Comp Technol, Changsha 410075, Hunan, Peoples R China
[2] Hunan Normal Univ, Coll Math & Comp Sci, Changsha 410081, Hunan, Peoples R China
来源：
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES | 2011年 / 27卷 / 04期
基金：
中国国家自然科学基金;
关键词：
G-queues; batch Markovian arrival process (BMAP); setup times; multiple vacations; censoring technique; Markov chains; N-POLICY; SYSTEM; DECOMPOSITION; CUSTOMERS; ARRIVALS;
D O I：
10.1007/s10255-011-0052-3
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we consider a BMAP/G/1 G-queue with setup times and multiple vacations. Arrivals of positive customers and negative customers follow a batch Markovian arrival process (BMAP) and Markovian arrival process (MAP) respectively. The arrival of a negative customer removes all the customers in the system when the server is working. The server leaves for a vacation as soon as the system empties and is allowed to take repeated (multiple) vacations. By using the supplementary variables method and the censoring technique, we obtain the queue length distributions. We also obtain the mean of the busy period based on the renewal theory.
引用
收藏
页码：625 / 638
页数：14
相关论文
共 50 条
12345