Results 151 to 160 of about 796 (198)
Some of the next articles are maybe not open access.
On the Conditional Probability of a Successful Retrial in Retrial Queues
INFOR: Information Systems and Operational Research, 2011Abstract Customer retrials are very common phenomena in industrial engineering and business management. The number of retrials required before receiving a success is an important measure for evaluating system performance. Focusing on the M/M/1 and M/M/2 retrial queues, we study the conditional probability of a successful retrial given that all previous
Bin Liu, Jinting Wang, Yiqiang Q. Zhao
openaire +1 more source
Approximations of retrial queue with limited number of retrials
Computers & Operations Research, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang Woo Shin, Dug Hee Moon
openaire +2 more sources
Analyzing retrial queues by censoring
Queueing Systems, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bin Liu, Yiqiang Q. Zhao
openaire +1 more source
On Truncations for a Retrial Queueing Model
Journal of Mathematical Sciences, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kiseleva, K. M. +2 more
openaire +2 more sources
Estimation of retrial rate in a retrial queue
Queueing Systems, 1995Describing the time evolution of a purely exponential retrial queue by a two-dimensional vector (number of call attempts since last departure, number of calls in retrial queue) yields a nonstandard Markovian description of the system's time evolution. The second coordinate of this process determines essentially the retrial rate, but is not accessible ...
openaire +2 more sources
Queueing Systems, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A survey of retrial queueing systems
Annals of Operations Research, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jeongsim Kim, Bara Kim
openaire +1 more source
Tail asymptotics of the queue size distribution in the M/M/m retrial queue
We consider an M/M/m retrial queue and investigate the tail asymptotics for the joint distribution of the queue size and the number of busy servers in the steady state. The stationary queue size distribution with the number of busy servers being fixed is
Jerim Kim, Jeongsim Kim, Bara Kim
exaly +2 more sources
Top, 1999
This is a short summary of a part of the history of retrial queues with emphasis on the preparation of the book ``Retrial queues'' by \textit{G. Falin} and \textit{J. G. C. Templeton} [London: Chapman \& Hall/CRC Press (1997)].
openaire +2 more sources
This is a short summary of a part of the history of retrial queues with emphasis on the preparation of the book ``Retrial queues'' by \textit{G. Falin} and \textit{J. G. C. Templeton} [London: Chapman \& Hall/CRC Press (1997)].
openaire +2 more sources
A Priority Retrial Queue with Constant Retrial Policy
2018We analyse a priority queueing system with a normal queue (high priority) and an orbit (low priority). Only the first customer in orbit can retry during times that the queue and server are empty (constant retrial policy). In contrast with existing literature, we assume different service time distributions for the high- and low-priority customers.
Arnaud Devos +2 more
openaire +1 more source

