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
Journal ArticleDOI
20 Sep 2018
TL;DR: This paper treats an M/G/1 retrial queue with abandoned customers and multi-optional vacations, using the embedded Markov chain technique and the Laplace-Stieltjes transform of the sojourn time distribution.
Abstract: This paper treats an M/G/1 retrial queue with abandoned customers and multi-optional vacations. If the server is found busy upon a new arrival, the customer being served could be abandoned by the s...

1 citations

Journal ArticleDOI
TL;DR: The almost unobservable case is studied, in which the information of the queue length is unavailable, whereas the state of the server can be obtained, and steady state solutions are derived and the individual equilibrium strategies are analyzed.
Abstract: An M/M/1 constant retrial queue with balking customers and set-up time is considered. Once the system becomes empty, the server will be turned down to reduce operating costs, and it will be activated only when there is a customers arrives. In this paper, the almost unobservable case is studied, in which the information of the queue length is unavailable, whereas the state of the server can be obtained. Firstly, the steady state solutions are derived and the individual equilibrium strategies are analyzed. In addition, social optimization problems, including cost analysis and social welfare maximization are investigated by using the PSO algorithm. Finally, by appropriate numerical examples, the sensitivity of some main system parameters is shown.

1 citations

Journal ArticleDOI
TL;DR: In the original publication of the article, the below-mentioned equations had been incorrectly published.
Abstract: In the original publication of the article, the below-mentioned equations had been incorrectly published.

1 citations

DOI
02 Sep 2018
TL;DR: Mixed priority services are used and reneging to occur at the orbit is considered, using supplementary variable technique, and the stability condition is derived.
Abstract: Incoming calls are arrive at the service system according to compound Poisson process. During the idle time, the server making an outgoing call with an exponentially distributed time. If the incoming call that finds the server busy will join an orbit. Here we use mixed priority services i.e., an arriving call may interrupt the service of an outgoing call or join the retrial queue (orbit). The server takes Bernoulli vacation. The server may become inactive due to normal as well as abnormal breakdown. After the completion of service, vacation and repair the server is in idle state. We consider reneging to occur at the orbit. Using supplementary variable technique, the stability condition is derived.

1 citations


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