Accessible bibliography on retrial queues
01 Aug 1999-Mathematical and Computer Modelling (Elsevier Science Publishers B. V.)-Vol. 30, Iss: 3, pp 1-6
About: This article is published in Mathematical and Computer Modelling.The article was published on 1999-08-01 and is currently open access. It has received 397 citations till now. The article focuses on the topics: Retrial queue & Queueing theory.
Citations
More filters
TL;DR: The present document is an abridged version of a survey that can be downloaded from www.cs.vu.nl/obp/callcenters and ie.technion.il/∼serveng.
Abstract: This is a survey of some academic research on telephone call centers. The surveyed research has its origin in, or is related to, queueing theory. Indeed, the “queueing-view” of call centers is both natural and useful. Accordingly, queueing models have served as prevalent standard support tools for call center management. However, the modern call center is a complex socio-technical system. It thus enjoys central features that challenge existing queueing theory to its limits, and beyond. The present document is an abridged version of a survey that can be downloaded from www.cs.vu.nl/obp/callcenters and ie.technion.ac.il/∼serveng.
354 citations
Additional excerpts
...This leads to retrial models (see [6,17,19])....
[...]
Book•
07 Aug 2013
TL;DR: This book emphasizes stochastic modeling by offering probabilistic interpretation and constructive proofs for Matrix-Analytic Methods, especially useful for engineering analysis and design.
Abstract: Fundamentals of Matrix-Analytic Methods targets advanced-level students in mathematics, engineering and computer science. It focuses on the fundamental parts of Matrix-Analytic Methods, Phase-Type Distributions, Markovian arrival processes and Structured Markov chains and matrix geometric solutions. New materials and techniques are presented for the first time in research and engineering design. This book emphasizes stochastic modeling by offering probabilistic interpretation and constructive proofs for Matrix-Analytic Methods. Such an approach is especially useful for engineering analysis and design. Exercises and examples are provided throughout the book.
218 citations
TL;DR: An analytic queueing network model which preserves the finite capacity of the queues and uses structural parameters to grasp the between-queue correlation and is applied to study patient flow in a network of units of the Geneva University Hospital.
171 citations
Cites background from "Accessible bibliography on retrial ..."
...Surveys focusing on specific application fields exist for the software architecture sector (Balsamo et al., 2003), the production and manufacturing sector (Papadopoulos and Heavey, 1996) and on retrial queues for the telecommunications sector (Artalejo, 1999)....
[...]
..., 2003), the production and manufacturing sector (Papadopoulos and Heavey, 1996) and on retrial queues for the telecommunications sector (Artalejo, 1999)....
[...]
TL;DR: To limit the scope of this survey, it is decided to research on papers dealing with the three policies (N, T, and D), where a cost function is designed specifically and optimal thresholds that yield minimum cost are sought.
Abstract: We have divided this review into two parts. The first part is concerned with the optimal design of queueing systems and the second part deals with the optimal control of queueing systems. The second part, which has the lion’s share of the review since it has received the most attention, focuses mainly on the modelling aspects of the problem and describes the different kinds of threshold (control) policy models available in the literature. To limit the scope of this survey, we decided to limit ourselves to research on papers dealing with the three policies (N, T, and D), where a cost function is designed specifically and optimal thresholds that yield minimum cost are sought.
159 citations
TL;DR: The theory of retrial queues as discussed by the authors is a branch of the queueing theory, characterized by the following basic assumption: a customer who cannot get service (due to finite capacity of the system, balking, impatience, etc.) leaves the service area, but after some random delay returns to the system again.
Abstract: We describe main models and results of a new branch of the queueing theory, theory of retrial queues, which is characterized by the following basic assumption: a customer who cannot get service (due to finite capacity of the system, balking, impatience, etc.) leaves the service area, but after some random delay returns to the system again. Emphasis is done on comparison with standard queues with waiting line and queues with losses. We give a survey of main results for both single server M/G/1 type and multiserver M/M/c type retrial queues and discuss similarities and differences between the retrial queues and their standard counterparts. We demonstrate that although retrial queues are closely connected with these standard queueing models they, however, possess unique distinguished features. We also mention some open problems.
116 citations
Cites background from "Accessible bibliography on retrial ..."
...The interested reader may find useful material about the above variants and many other retrial models in the monograph [26], the papers [5, 7] and the references therein....
[...]
...literature the reader is referred to the papers [5, 7, 23, 35, 50]....
[...]