Analysis of batch arrival queue with randomized vacation policy and an un-reliable server

Abstract

This paper examines an M[x]/G/1 queueing system with an unreliable server and a delayed repair, in which the server operates a randomized vacation policy with multiple vacations. Whenever the system is empty, the server immediately takes a vacation. If there is at least one customer found waiting in the queue upon returning from a vacation, the server will be immediately activated for service. Otherwise, if no customers are waiting for service at the end of a vacation, the server either remains idle with probability p or leaves for another vacation with probability 1 −p. Whenever one or more customers arrive when the server is idle, the server immediately starts providing service for the arrivals. The server may also meet an unpredictable breakdown and the repair may be delayed. For such a system the authors derive the distributions of some important system characteristics, such as the system size distribution at a random epoch and at a departure epoch, the system size distribution at the busy period initiation epoch, and the distribution of the idle period and the busy period. The authors perform a numerical analysis for changes in the system characteristics, along with changes in specific values of the system parameters. A cost effectiveness maximization model is constructed to explain the benefits of such a queueing system.