Results 161 to 170 of about 672 (207)
Some of the next articles are maybe not open access.
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 +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
The Israeli queue with retrials
Queueing Systems, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nir Perel, Uri Yechiali
openaire +3 more sources
On the stability of retrial queues
Queueing Systems, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eitan Altman, Aleksandr A. Borovkov
openaire +2 more sources
On multiserver feedback retrial queues with balking and control retrial rate
Annals of Operations Research, 2006The paper considers a multiserver retrial queueing system in which primary customers arrive according to a Poisson process. The service facility consists of a finite number of identical servers and service times are exponentially distributed. An arriving customer who finds all servers busy enters the retrial group with probability \(p\) or is lost ...
B. Krishna Kumar, J. Raja
openaire +1 more source
Stability analysis of a multiclass retrial system with classical retrial policy
Performance Evaluation, 2017We consider a multiserver retrial queueing system with a renewal input, K classes of customers, and a finite buffer. Service times are class-dependent, however, for each class, are independent, identically distributed (iid). A new class-i customer joins the primary system (servers and buffer), otherwise, if all servers and buffer are full, he joins the
Evsey Morozov, Tuan Phung-Duc
openaire +2 more sources
APPROXIMATION OF PH/PH/c RETRIAL QUEUE WITH PH-RETRIAL TIME
Asia-Pacific Journal of Operational Research, 2014We consider the PH/PH/c retrial queues with PH-retrial time. Approximation formulae for the distribution of the number of customers in service facility, sojourn time distribution and the mean number of customers in orbit are presented. We provide an approximation for GI/G/c retrial queue with general retrial time by approximating the general ...
YANG WOO SHIN, DUG HEE MOON
openaire +4 more sources
Approximation of M/M/c retrial queue with PH-retrial times
European Journal of Operational Research, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang Woo Shin, Dug Hee Moon
openaire +1 more source
NUMBER OF RETRIALS IN A FINITE SOURCE RETRIAL QUEUE WITH UNRELIABLE SERVER
Asia-Pacific Journal of Operational Research, 2014The object of this paper is to continue investigation of a single server retrial queue with finite number of sources in which the server is subjected to breakdowns and repairs. The server life time as well as the intervals between repetitions are exponentially distributed, while the repair and the service times are generally distributed.
openaire +3 more sources
A Model of Rational Retrials in Queues
SSRN Electronic Journal, 2014Customers often wait in queues before being served. Because waiting is undesirable, customers may come back later (i.e., retry) when the queue is too long. However, retrial attempts can be costly as a result of transportation fees and service delays. This paper introduces a framework for rational retrial decisions in stationary queues.
Shiliang Cui +2 more
openaire +1 more source