scispace - formally typeset
Search or ask a question
Topic

Retrial queue

About: Retrial queue is a research topic. Over the lifetime, 784 publications have been published within this topic receiving 12354 citations.


Papers
More filters
Posted Content
TL;DR: In this article, the average number of parked delivery trucks and their waiting time were obtained by using an M/G/1 retrial queue system, and Matlab was used to represent them graphically then analyzed the RTG performances according to the traffic rate.
Abstract: In front of the major challenges to increase its productivity while satisfying its customer, it is today important to establish in advance the operational performances of the RTG Abidjan Terminal. In this article, by using an M/G/1 retrial queue system, we obtained the average number of parked delivery trucks and as well as their waiting time. Finally, we used Matlab to represent them graphically then analyze the RTG performances according to the traffic rate.
Posted ContentDOI
05 Mar 2022
TL;DR: In this article , a single-server queue with general retrial times and event-dependent arrivals is introduced, in which the server needs a non-negligible time to retrieve waiting customers upon a service completion, while future arrivals depend on the last realized event.
Abstract: We introduce a novel single-server queue with general retrial times and event-dependent arrivals. This is a versatile model for the study of service systems, in which the server needs a non-negligible time to retrieve waiting customers upon a service completion, while future arrivals depend on the last realized event. Such a model is motivated by the customers' behaviour in service systems where they decide to join based on the last realized event. We investigate the necessary and sufficient stability condition and derive the stationary distribution both at service completion epochs, and at an arbitrary epoch using the supplementary variable technique. We also study the asymptotic behaviour under high rate of retrials. Performance measures are explicitly derived and extensive numerical examples are performed to investigate the impact of event-dependency. Moreover, constrained optimisation problems are formulated and solved with ultimate goal to investigate the admission control problem.
Journal ArticleDOI
TL;DR: In this paper , a retrial queue with classical retrial policy, where each blocked customer in the orbit retries for service, and general retrial times is modeled by a piecewise deterministic Markov process (PDMP), is derived.
Abstract: Abstract A retrial queue with classical retrial policy, where each blocked customer in the orbit retries for service, and general retrial times is modeled by a piecewise deterministic Markov process (PDMP). From the extended generator of the PDMP of the retrial queue, we derive the associated martingales. These results are used to derive the conditional expected number of customers in the orbit in the transient regime.

Network Information
Related Topics (5)
Linear programming
32.1K papers, 920.3K citations
78% related
Markov chain
51.9K papers, 1.3M citations
77% related
Supply chain management
39K papers, 1M citations
77% related
Scheduling (computing)
78.6K papers, 1.3M citations
76% related
Optimization problem
96.4K papers, 2.1M citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202326
202259
202135
202056
201947
201844