Finite buffer servers' vacation queue with change over times

International Journal of Applied Mathematics and Computation

P. Vijaya Laxmi¹  Seleshi Demie² 

[1] Department of Applied Mathematics, Andhra University, Visakhapatnam, Andhra Pradesh$$;Veena Goswami$$

关键词: Queue;    Finite bu®er;    Multiple vacation;    Single vacation;    Genetic algorithm;   

DOI  :  10.0000/ijamc.2012.4.4.506

来源: PSIT Kanpur

【 摘 要 】

This paper analyzes a finite buffer multiple and single vacation queues with change over times under (a,c,b) policy. The inter-arrival, 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). After a service completion if the queue size is less than c but not less than a secondary limit a , the server continues to serve and it takes a vacation if the queue size is less than a. The steady state queue length distributions are obtained and optimal cost policy is presented with some 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.  

【 授权许可】

Unknown