Abstract
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 q ueue 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Applied Mathematics and Computation
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
