On the Single-Server Retrial Queue
Natalia V. Djellab (2006)
The Yugoslav Journal of Operations Research
Similarity:
Natalia V. Djellab (2006)
The Yugoslav Journal of Operations Research
Similarity:
Natalia V. Djellab (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Retrial queueing systems are characterized by the requirement that customers finding the service area busy must join the retrial group and reapply for service at random intervals. This paper deals with the M/G/1 retrial queue subjected to breakdowns. We use its stochastic decomposition property to approximate the model performance in the case of general retrial times.
Cooper, Robert B., Niu, Shun-Chen, Srinivasan, Mandyam M. (1998)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Lee, Ho Woo, Lee, Soon Seok, Chae, K.C. (1996)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
W. Szczotka (1974)
Applicationes Mathematicae
Similarity:
Dshalalow, Jewgeni H., Yellen, Jay (1996)
Mathematical Problems in Engineering
Similarity:
Gupta, U.C., Sikdar, Karabi (2004)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Gupta, U.C., Banik, A.D., Pathak, S.S. (2005)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
I. Kopocińska (1970)
Applicationes Mathematicae
Similarity:
V. Jailaxmi, R. Arumuganathan, M. Senthil Kumar (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
This paper analyses an M/G/1 retrial queue with working vacation and constant retrial policy. As soon as the system becomes empty, the server begins a working vacation. The server works with different service rates rather than completely stopping service during a vacation. We construct the mathematical model and derive the steady-state queue distribution of number of customer in the retrial group. The effects of various performance measures are derived.
Loris-Teghem, J. (2000)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Kailash C. Madan, Walid Abu-Dayyeh (2002)
ESAIM: Probability and Statistics
Similarity:
We investigate the steady state behavior of an //1 queue with modified Bernoulli schedule server vacations. Batches of variable size arrive at the system according to a compound Poisson process. However, all arriving batches are not allowed into the system. The restriction policy differs when the server is available in the system and when he is on vacation. We obtain in closed form, the steady state probability generating functions for the number of customers in the queue for various...