Efficient method to approximately solve retrial systems with impatience

DOI10.1155/2012/186761zbMath1236.60089OpenAlexW2006144540WikidataQ58905854 ScholiaQ58905854MaRDI QIDQ410883

Jorge Martinez-Bauset, Jose Manuel Gimenez-Guzman, Vicente Casares-Giner, Vicent Pla, M. Jose Domenech-Benlloch

Publication date: 4 April 2012

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/186761

zbMATH Keywords

multiserver retrial systems with impatiencepolynomial extrapolation methodsystem in its Markov decision process settingvalue extrapolation

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Continuous-time Markov processes on discrete state spaces (60J27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accessible bibliography on retrial queues: progress in 2000-2009
• Calculation of probability characteristics of a multiline system with repeated calls
• Numerical investigation of a multiserver retrial model
• Generalized truncated methods for an efficient solution of retrial systems
• Numerical calculation of the stationary distribution of the main multiserver retrial queue
• Finite birth-and-death models in randomly changing environments

This page was built for publication: Efficient method to approximately solve retrial systems with impatience