OPTIMIZATION OF RENEWAL INPUT (a, c, b) POLICY WORKING VACATION QUEUE WITH CHANGE OVER TIME AND BERNOULLI SCHEDULE VACATION INTERRUPTION

OPTIMIZATION OF RENEWAL INPUT (a, c, b) POLICY WORKING VACATION QUEUE WITH CHANGE OVER TIME AND BERNOULLI SCHEDULE VACATION INTERRUPTION

P. Vijaya Laxmi, V. Goswami, D. Seleshi

[PDF]

Abstract

This paper presents a renewal input single working vacation queue with change over time and Bernoulli schedule vacation interruption under (a, c, b) policy. The service and vacation times are exponentially distributed. 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 period follows if there are (a − 1) customers at service completion instants. The steady state queue length distributions at arbitrary and pre-arrival epochs are obtained. An optimal cost policy is presented along with few numerical experiences. The genetic algorithm and quadratic t search method are employed to search for optimal values of some important parameters of the system.

Keywords

Single working vacation, vacation interruption, cost, queue, genetic algorithm.