Results 151 to 160 of about 54,946 (185)
Some of the next articles are maybe not open access.
TWO QUEUES IN TANDEM WITH RETRIAL CUSTOMERS
Probability in the Engineering and Informational Sciences, 2001This paper deals with two single server queues (nodes) in tandem, in which customers to the first node arrive according to a Poisson process. The service times at the two nodes are independent and arbitrarily distributed random variables. There is no waiting position between the two nodes.
Moutzoukis, Evangelos +1 more
openaire +2 more sources
On a Multi-Channel Retrial Queueing System
Cybernetics and Systems Analysis, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pryshchepa, O. V., Lebedev, E. O.
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
IEEE Transactions on Information Theory, 1988
An overloaded service system may reject customers if it has no queue to store them. In practice, rejected customers return later to make retrials and may not leave permanently (balk) until several retrials fail. A single-server system with Poisson arrivals is examined in which rejected customers balk or make retrials according to a simple probabilistic
openaire +1 more source
An overloaded service system may reject customers if it has no queue to store them. In practice, rejected customers return later to make retrials and may not leave permanently (balk) until several retrials fail. A single-server system with Poisson arrivals is examined in which rejected customers balk or make retrials according to a simple probabilistic
openaire +1 more source
Loss probability properties in retrial queues
Operations Research Letters, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chia-Li Wang, Ronald W. Wolff
openaire +2 more sources
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 Finite Source Retrial Queue: Number of Retrials
Communications in Statistics - Theory and Methods, 2013We consider a single-server queuing system with a finite number of sources, where customers are not allowed to queue; instead of that, they make repeated attempts, or retrials, in order to enter service after some time. This queuing system and its variants are widely used to model disk memory systems, star-like local area networks, and other ...
openaire +1 more source
Stochastic Decomposition in Retrial Queueing Inventory System
Proceedings of the 11th International Conference on Queueing Theory and Network Applications, 2016The purpose of this paper is to obtain product form solution for retrial – queueing – inventory system. We study anM/M/1 retrial queue with a storage system driven by an (s,S) policy. When server is idle, external arrivals enter directly to an orbit. Inventory replenishment lead time is exponentially distributed.
Achyutha Krishnamoorthy, Dhanya Shajin
openaire +3 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
A retrial queue with redundancy and unreliable server
Queueing Systems, 1994This paper introduces a new version of the unreliable \(M/G/1/1\) retrial queue and obtains, amongst other things, using the theory of piecewise Markovian processes, the analogue of the Pollaczek-Khinchin formula for such a queue.
openaire +2 more sources