Performance analysis of renewal input $(a,c,b)$ policy queue with multiple working vacations and change over times
Pikkala Vijaya Laxmi Seleshi Demie
This paper analyzes a renewal input multiple working vacations queue with change over times 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\leq c \leq b)$. The steady state queue length distributions at arbitrary and pre-arrival epochs are obtained along with some special cases of the model. Performance measures and optimal cost policy is presented with numerical experiences for some particular values of the parameters. The genetic algorithm is employed to search the optimal values of some important parameters of the system.
keywords: queue genetic algorithm. Multiple working vacations infinite buffer supplementary variable cost

Year of publication

Related Authors

Related Keywords

[Back to Top]