Results 131 to 140 of about 393 (164)

A Priority Retrial Queue with Constant Retrial Policy

2018
We 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, Joris Walraevens, Herwig Bruneel   +2 more
openaire   +1 more source

On a tandem queue with retrials and losses

Operational Research, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On queueing systems by retrials

Journal of Applied Probability, 1983
A general result for queueing systems with retrials is presented. This result relates the expected total number of retrials conducted by an arbitrary customer to the expected total number of retrials that take place during an arbitrary service time.
openaire   +1 more source

Loss probability properties in retrial queues

Operations Research Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chia-Li Wang, Ronald W. Wolff
openaire   +2 more sources

Retrials and balks (queueing)

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

TWO QUEUES IN TANDEM WITH RETRIAL CUSTOMERS

Probability in the Engineering and Informational Sciences, 2001
This 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, Langaris, Christos   +1 more
openaire   +2 more sources

On a Multi-Channel Retrial Queueing System

Cybernetics and Systems Analysis, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pryshchepa, O. V., Lebedev, E. O.
openaire   +2 more sources

NUMBER OF RETRIALS IN A FINITE SOURCE RETRIAL QUEUE WITH UNRELIABLE SERVER

Asia-Pacific Journal of Operational Research, 2014
The 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   +2 more sources

A Finite Source Retrial Queue: Number of Retrials

Communications in Statistics - Theory and Methods, 2013
We 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, 2016
The 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   +2 more sources