ON (A,C,B) POLICY QUEUE WITH CHANGE OVER TIMES UNDER BERNOULLI SCHEDULE VACATION INTERRUPTION

Abstract

This paper analyzes a renewal input working vacations queue with change over times and Bernoulli schedule<br />vacation interruption under (a,c,b) policy.<br />The service and vacation times are exponentially distributed.<br />The server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a<=c <= b). The change over periods follow if there are (c-1) customers (at vacation completion instant) or (a-1) customers<br />at service completion instants. The steady state queue length distributions at arbitrary and pre-arrival epochs are obtained. Performance measures and optimal cost policy are<br />presented with numerical experiences.<br />The genetic algorithm and quadratic fit search method are employed to search the optimal values of some important parameters of the system.