Article ID: | iaor20052372 |
Country: | Netherlands |
Volume: | 157 |
Issue: | 1 |
Start Page Number: | 169 |
End Page Number: | 179 |
Publication Date: | Aug 2004 |
Journal: | European Journal of Operational Research |
Authors: | Krishnamoorthy A., Dudin A.N., Tsarenkov G.V., Joshua V.C. |
Keywords: | markov processes |
We consider a single server retrial queuing model in which customers arrive according to a batch Markovian arrival process. Any arriving batch finding the server busy enters into an orbit. Otherwise one customer from the arriving batch enters into service immediately while the rest join the orbit. The customers from the orbit try to reach the service later and the inter-retrial times are exponentially distributed with intensity depending (generally speaking) on the number of customers on the orbit. Additionally, the search mechanism can be switched-on at the service completion epoch with a known probability (probably depending on the number of customers on the orbit). The duration of the search is random and also probably depending on the number of customers in the orbit. The customer, which is found as the result of the search, enters the service immediately if the server is still idle. Assuming that the service times of the primary and repeated customers are generally distributed (with possibly different distributions), we perform the steady state analysis of the queueing model.