A batch arrival Bernoulli vacation queue with a random setup time under restricted admissibility policy

A batch arrival Bernoulli vacation queue with a random setup time under restricted admissibility policy

0.00 Avg rating0 Votes
Article ID: iaor20072614
Country: United Kingdom
Volume: 2
Issue: 1
Start Page Number: 81
End Page Number: 97
Publication Date: Jan 2007
Journal: International Journal of Operational Research
Authors: ,
Keywords: vacation models, M/M/1 queues
Abstract:

We consider a batch arrival queue with a Bernoulli vacation schedule, where, after completion of a service, the server either goes for a vacation of random length with probability p (0<p<1) or may continue to serve the next unit, if any, with probability (1−p), under a Restricted Admissibility (RA) policy of arriving batches with a random Setup Time (SET). Unlike the usual batch arrival queueing system, the RA-policy differs during a busy period and a vacation period and hence all arriving batches are not allowed to join the system at all times. We derive the steady state queue size distributions at a random point of time as well as at a departure epoch. Also, we obtain some important performance measures of this model. Further, we demonstrate the existence of stochastic decomposition result for this type of model.

Reviews

Required fields are marked *. Your email address will not be published.