Queueing systems with renovation.
Kreinin, A.Ya. (1997)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Kreinin, A.Ya. (1997)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Ghosal, A., Madan, S. (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Shin, Yang Woo (1999)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Choi, Bong Dae, Kim, Yeong Cheol, Shin, Yang Woo, Pearce, Charles E.M. (2001)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Artalejo, J.R., Gomez-Corral, A. (1996)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Frey, Andreas, Takahashi, Yoshitaka (1999)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
R. G. Rani (1974)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Loris-Teghem, Jacqueline (2000)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Tadj, Lotfi, Benkherouf, Lakdere, Aggoun, Lakhdar (1998)
Mathematical Problems in Engineering
Similarity:
Kernane, Tewfik, Aïssani, Amar (2006)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Babitsky, Alexander V. (1997)
Mathematical Problems in Engineering
Similarity:
Limic, Vlada (2000)
Electronic Communications in Probability [electronic only]
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.