Skip to main content
Log in

A repairable discrete-time retrial queue with recurrent customers, Bernoulli feedback and general retrial times

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

This paper relates to a repairable Geo/G/1 retrial queue with general retrial times, Bernoulli feedback, the server subjected to starting failures and two types of customers: transit and a fixed number of recurrent customers. After service completion, recurrent customers always return to the orbit and transit customers either immediately return to the orbit for another service with probability \(\theta (0\leq\theta<1)\) or leave the system forever with probability 1 − θ. We construct the mathematical model and present some performance measures of the model in steady-state. We provide a stochastic decomposition law and analyze the relationship between our discrete-time system and its continuous-time counterpart. Finally, some numerical examples show the influence of the parameters on the performance characteristics of the system.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Aboul-Hassan AK, Rabia S, Taboly F (2009) Performance evaluation of a discrete-time Geo [X]/G/1 retrial queue with general retrial times. Comput Math Appl 58:548–557

    Article  Google Scholar 

  • Alfa AS (2006) Discrete-time analysis of the GI/G/1 system with Bernoulli retrials: an algorithmic approach. Ann Oper Res 141:52–66

    Article  Google Scholar 

  • Artalejo JR (1999a) A classified bibliography of research on retrial queues: progress in 1990–1999. Top 7(2):187–211

    Article  Google Scholar 

  • Artalejo JR (1999b) Accessible bibliography on retrial queues. Math Comput Modell 30:1–6

    Article  Google Scholar 

  • Artalejo JR, Atencia I, Moreno P (2005) A discrete-time Geo [X]/G/1 retrial queue with control of admission. Appl Math Modell 29:1100–1120

    Article  Google Scholar 

  • Artalejo JR, Gómez-Corral A (2008) Retrial queueing systems: a computational approach. Springer, Berlin

    Book  Google Scholar 

  • Atencia I, Fortes I, Nishimura S, Sánchez S (2010) A discrete-time retrial queueing system with recurrent customers. Comput Oper Res 37:1167–1173

    Article  Google Scholar 

  • Atencia I, Fortes I, Sánchez S (2009) A discrete-time retrial queueing system with starting failures, Bernoulli feedback and general retrial times. Comput Ind Eng 57(4):1291–1299

    Article  Google Scholar 

  • Atencia I, Moreno P (2004) Discrete-time Geo X/G H /1 retrial queue with Bernoulli feedback. Comput Math Appl 47:1273–1294

    Article  Google Scholar 

  • Atencia I, Moreno P (2006) A discrete-time Geo/G/1 retrial queue with server breakdowns. Asia Pacific J Oper Res 23:247–271

    Article  Google Scholar 

  • Boxma OJ, Cohen JW (1991) The M/G/1 queue with permanent customers. IEEE J Select Areas Commun 9(2):179–184

    Article  Google Scholar 

  • Falin GI (1990) A survey on retrial queues. Queueing Syst 7:127–167

    Article  Google Scholar 

  • Falin GI, Templeton JGC (1997) Retrial queues. Chapman & Hall, London

    Google Scholar 

  • Farahmand K (1996) Single line queue with recurrent repeated demands. Queueing Syst 22:425–435

    Article  Google Scholar 

  • Fuhrmann SW, Cooper RB (1985) Stochastic decompositions in the M/G/1 queue with generalized vacations. Oper Res 33(5):1117–1129

    Article  Google Scholar 

  • Gómez-Corral A (2006) A bibliographical guide to analysis of retrial queues through matrix analytic techniques. Ann Oper Res 141:163–191

    Article  Google Scholar 

  • Krishna Kumar B, Arivudainambi D (2002)The M/G/1 retrial queue with Bernoulli schedules and general retrial times. Comput Math Appl 43:15–30

    Article  Google Scholar 

  • Moreno P (2004) An M/G/1 retrial queue with recurrent customers and general retrial times. Appl Math Comput 159:651–666

    Article  Google Scholar 

  • Takacs l (1963) A single server queue with feedback. Bell Syst Tech J 42:505–519

    Google Scholar 

  • Wang J (2004) An M/G/1 queue with second optional service and server breakdowns. Comput Math Appl 47:1713–1723

    Article  Google Scholar 

  • Wang J, Zhao Q (2007) A discrete-time Geo/G/1 retrial queue with starting failures and second optional service. Comput Math Appl 53:115–127

    Article  Google Scholar 

  • Yang T, Li H (1994) The M/G/1 retrial queue with the server subject to starting failures. Queueing Syst 16:83–96

    Article  Google Scholar 

  • Yang T, Li H (1995) On the steady-state queue size distribution of the discrete-time Geo/G/1 queue with repeated customers. Queueing Syst 21:199–215

    Article  Google Scholar 

  • Yang T, Templeton JGC (1987) A survey on retrial queues. Queueing Syst 2:201–233

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shan Gao.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gao, S., Liu, Z. & Dong, H. A repairable discrete-time retrial queue with recurrent customers, Bernoulli feedback and general retrial times. Oper Res Int J 12, 367–383 (2012). https://doi.org/10.1007/s12351-010-0098-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-010-0098-7

Keywords

Mathematics Subject Classification (2000)

Navigation