Resumen de An M/G/1 queueing system with compulsory server vacations

K. C. Madan

• This paper deals with a single server queue with compulsory server vacations. There are single Poisson arrivals with mean arrival date ? and the service is performed in batches of fixed size M (=1) or min (n, M) and the service times of successive batches follow a general distribution with the density function D(x). The Laplace transforms of the probability generating functions of different states of the system have been obtained, the corresponding steady state results have been derived and in a particular case the mean queue length has been obtained explicitly.