Pure Decrementing Service M/G/1 Queue with Multiple Adaptive Vacations

Abstract

In this paper, an M/G/1 queue model with the multiple adaptive vacations and pure decrementing service policy is studied based on the classical M/G/1 queueing model. The PGF of stationary queue length is derived by using an embedded Markov chain method. The LST of stationary waiting time is also given according to the independence between waiting time and arrival process. The average probabilities of various system states are obtained. Some special cases are given to show the general properties of the new model.