A Discrete Time (a, c, d) Policy Bulk Service Queue with Accessible and Non-accessible Batches

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

Abstract

In this paper we consider a discrete time (a, c, d) policy bulk service queue
with accessible and non-accessible batches. Here the server begins service only if the number of units in the queue (n) is at least c and serves a maximum of d units in a batch, with or without accessibility to the batches of ongoing service according as the on going service batch size is less than b or not. The server continue to serve even when the system size is less than c but not less than a secondary limit a(a c b d), after a service completion epoch. The analysis of the model is considered and the steady state probabilities, expected queue length, expected cost function and optimality problem are obtained.