Renewal input (a, c, b) policy queue with multiple vacations and change over times

P. Vijaya Laxmi, V. Goswami and Demie Seleshi

International Journal of Mathematics in Operational Research, 2013, vol. 5, issue 4, 466-491

Abstract: This paper analyses a renewal input multiple 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 ≤ c ≤ b). At service completion instant, if the queue size is less than c but not less than a secondary limit a, the server continues to serve and takes vacation if the queue size is less than a − 1. The server is in change over period whenever the queue size is a − 1 at service completion instant and c − 1 at vacation completion instant. The steady state queue length distributions at both arbitrary and pre-arrival epochs are obtained and an optimal cost policy is presented with some numerical experiences for some particular values of the parameters using genetic algorithm.

Keywords: multiple vacation queues; optimal cost policy; supplementary variables; infinite buffers; genetic algorithms; renewal input. (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=54731 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:5:y:2013:i:4:p:466-491

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().