A Discrete Time (a, c, d) Policy Bulk Service Queue

C. Baburaj

《International Journal of Information and Management Sciences》 21：4 (2010/12) Pp. 469-480

https://doi.org/10.6186/IJIMS.2010.21.4.6

並列摘要

This paper presents a discrete time bulk service queue under the policy (a, c, d). The interarrival times are assumed to be independent and geometrically distributed. The customers are served by a single server under the policy (a, c, d). In this model the server begins service only when there are at least c units in the queue and he serves a maximum of d units in a batch. The server continue to serve even when the queue size is less than c but not less than a secondary limit a, after a service completion epoch. If after a service completion epoch the queue size is less than a, the server becomes idle. The service times are also assumed to be independent and geometrically distributed. The steady state probabilities and some performance measures of the model are computed.

並列關鍵字

(a, c, d) Policy ； Discrete Time Queues ； Batch Service ； Geometric Distribution ； Steady State Distribution ； Expected Queue

參考文獻

Baburaj, C.(2010).An M/G/1 single and batch service queue under the policy (a, c, d).International Journal of Agriculture and Statistical Sciences.6(2)

(Baburaj, C., An (a, c, d) policy bulk service queue with delayed vacation, (communicated).).

Baburaj, C. A(1999).single and batch service M/M/1 queue with a control on the batch size.International Journal of Information and management Sciences.10(4),15-22.

Baburaj, C.,Surendranath, T. M.(2005).An M/M/1 bulk service queue under the policy (a, c, d).Int. J. Agricult. Stat.1(2),27-33.

Bruneel, H.(1993).Performance of discrete-time queueing systems.Comput. Oper. Res..20,303-320.