IEEE Access · 2020 · 23 citations · 28 references
BusinessIndustrial EngineeringMarkov Decision ProcessesQueuing TheoryStochastic ProcessesQueue Length DistributionsQueueing AnalysisQueueing ProcessesQueueing SystemsQueueing TheoryQueuing AnalysisEmbedded Markov Chain AnalysisM/g/1 QueuesQueueing Stability AnalysisRetrial QueuesSteady-state Queue AnalysisSteady-state Queue LengthSteady-state Queue Length DistributionSteady-state Queueing Analysis
This article studies an M/G/1 retrial queue with two types of breakdowns. When the server is idle, it is subject to breakdowns according to a Poisson process with rate δ and it cannot be repaired immediately. While when the server is busy, it may break down according to a Poisson process with rate θ and can be immediately repaired. Firstly, based on embedded Markov chain technique and probability generating function (PGF) method, we present the necessary and sufficient condition for the system to be stable and the PGF of the orbit size at the departure epochs. Secondly, we give the steady-state joint queue length distribution by supplementary variable method, and present some important performance measures and reliability indices. Thirdly, we provide the analysis of sojourn time of an arbitrary customer in the system when the system is in stable state. Finally, some numerical examples are presented to illustrate the effect of the some system parameters on important performance measures and reliability indices.
28
G. Falin · Queueing Systems · 1990 · 482 citations
A survey of retrial queueing systems
Jeongsim Kim, Bara Kim · Annals of Operations Research · 2015 · 158 citations