Analysis of a bulk queue with fast and slow service rates and multiple vacations

We analyze an M^x/G(a,b)/1 queueing system with fast and slow service rates and multiple vacations. The server does the service with a faster rate or a slower rate based on the queue length. At a service completion epoch (or) at a vacation completion epoch if the number of customers waiting in the queue is greater than or equal to N (N > b), then the service is rendered at a faster rate, otherwise with a slower service rate. After finishing a service, if the queue length is less than ‘a’ the server leaves for a vacation of random length. When he returns from the vacation, if the queue length is still less than ‘a’ he leaves for another vacation and so on until he finally finds at least ‘a’ customers waiting for service. After a service (or) a vacation, if the server finds at least ‘a’ customers waiting for service say ξ, then he serves a batch of min(ξ, b) customers, where b ⩾ a. We derive the probability generating function of the queue size at an arbitrary time. Various performance measures are obtained. A cost model is discussed with a numerical solution.