On a bulk queueing system with impatient customers

被引：2

作者：

Tadj, L ^{[1
]}

Benkherouf, L ^{[1
]}

Aggoun, L ^{[1
]}

机构：

[1] King Saud Univ, Coll Sci, Dept Stat & Operat Res, Riyadh 11451, Saudi Arabia

来源：

MATHEMATICAL PROBLEMS IN ENGINEERING | 1998年 / 3卷 / 06期

关键词：

queue; impatience; embedded Markov chain; semi-regenerative process; steady-state distribution;

D O I：

10.1155/S1024123X97000677

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We consider a bulk arrival, bulk service queueing system. Customers are served in batches of r units if the queue length is not less than r. Otherwise, the server delays the service until the number of units in the queue reaches or exceeds level r. We assume that unserved customers may get impatient and leave the system. An ergodicity condition and steady-state probabilities are derived. Various system characteristics are also computed.

引用

页码：539 / 554

页数：16

共 6 条

[1]

ABOLNIKOV L, 1991, J APP MATH STOCH ANA, V5, P83

[2]

ABOLNIKOV L, 1990, J APP MATH STOCH ANA, V3, P227

[3]

Abolnikov L, 1991, J APPL MATH STOCHAST, V4, P333, DOI [10.1155/s1048953391000254, DOI 10.1155/S1048953391000254]

[4]

Dshalalow J.H., 1991, J. Appl. Math. Stoch. Anal, V4, P305, DOI [10.1155/S1048953391000230, DOI 10.1155/S1048953391000230]

[5]

DSHALALOW JH, 1993, STOCHASTIC STOCHASTI, V45, P45, DOI DOI 10.1080/17442509308833855

[6]

DSHALALOW JH, 1995, ADV QUEUEING, P243

← 1 →