IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v21y2013i3p542-571.html
   My bibliography  Save this article

A preemptive resume priority retrial queue with state dependent arrivals, unreliable server and negative customers

Author

Listed:
  • Ioannis Dimitriou

Abstract

In this paper we consider an unreliable single server retrial queue accepting two types of customers, with negative arrivals, preemptive resume priorities and vacations. A distinguishing feature of the model is that the rates of the Poisson arrival process depends on the server state. For this model we investigate the stability conditions and the joint queue length distribution in steady state. We also prove that our model satisfies the stochastic decomposition property. Transient, as well as steady state solutions for reliability measures are obtained. Finally, numerical results demonstrate the typical features of the model under consideration. Copyright Sociedad de Estadística e Investigación Operativa 2013

Suggested Citation

  • Ioannis Dimitriou, 2013. "A preemptive resume priority retrial queue with state dependent arrivals, unreliable server and negative customers," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(3), pages 542-571, October.
    • Handle: RePEc:spr:topjnl:v:21:y:2013:i:3:p:542-571
    DOI: 10.1007/s11750-011-0198-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-011-0198-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11750-011-0198-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J. George Shanthikumar, 1988. "On Stochastic Decomposition in M / G /1 Type Queues with Generalized Server Vacations," Operations Research, INFORMS, vol. 36(4), pages 566-569, August.
    2. J. Artalejo, 1999. "A classified bibliography of research on retrial queues: Progress in 1990–1999," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(2), pages 187-211, December.
    3. A. G. Pakes, 1969. "Some Conditions for Ergodicity and Recurrence of Markov Chains," Operations Research, INFORMS, vol. 17(6), pages 1058-1061, December.
    4. Ger Koole & Avishai Mandelbaum, 2002. "Queueing Models of Call Centers: An Introduction," Annals of Operations Research, Springer, vol. 113(1), pages 41-59, July.
    5. S. W. Fuhrmann & Robert B. Cooper, 1985. "Stochastic Decompositions in the M / G /1 Queue with Generalized Vacations," Operations Research, INFORMS, vol. 33(5), pages 1117-1129, October.
    6. Wang, Jinting & Liu, Bin & Li, Jianghua, 2008. "Transient analysis of an M/G/1 retrial queue subject to disasters and server failures," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1118-1132, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Samira Taleb & Amar Aissani, 2016. "Preventive maintenance in an unreliable M/G/1 retrial queue with persistent and impatient customers," Annals of Operations Research, Springer, vol. 247(1), pages 291-317, December.
    2. Anatoly Nazarov & Ekaterina Fedorova & Olga Lizyura & Radmir Salimzyanov, 2023. "Asymptotic Diffusion Method for Retrial Queues with State-Dependent Service Rate," Mathematics, MDPI, vol. 11(14), pages 1-10, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. I. Atencia & G. Bouza & P. Moreno, 2008. "An M [X] /G/1 retrial queue with server breakdowns and constant rate of repeated attempts," Annals of Operations Research, Springer, vol. 157(1), pages 225-243, January.
    2. Madhu Jain & Sandeep Kaur & Parminder Singh, 2021. "Supplementary variable technique (SVT) for non-Markovian single server queue with service interruption (QSI)," Operational Research, Springer, vol. 21(4), pages 2203-2246, December.
    3. Jeongsim Kim & Bara Kim, 2016. "A survey of retrial queueing systems," Annals of Operations Research, Springer, vol. 247(1), pages 3-36, December.
    4. Jianjun Li & Liwei Liu & Tao Jiang, 2018. "Analysis of an M/G/1 queue with vacations and multiple phases of operation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 51-72, February.
    5. Gao, Shan & Wang, Jinting, 2014. "Performance and reliability analysis of an M/G/1-G retrial queue with orbital search and non-persistent customers," European Journal of Operational Research, Elsevier, vol. 236(2), pages 561-572.
    6. Shweta Upadhyaya, 2020. "Investigating a general service retrial queue with damaging and licensed units: an application in local area networks," OPSEARCH, Springer;Operational Research Society of India, vol. 57(3), pages 716-745, September.
    7. T. Deepak, 2015. "On a retrial queueing model with single/batch service and search of customers from the orbit," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 493-520, July.
    8. B. Krishna Kumar & R. Rukmani & A. Thanikachalam & V. Kanakasabapathi, 2018. "Performance analysis of retrial queue with server subject to two types of breakdowns and repairs," Operational Research, Springer, vol. 18(2), pages 521-559, July.
    9. M. Boon, 2012. "A polling model with reneging at polling instants," Annals of Operations Research, Springer, vol. 198(1), pages 5-23, September.
    10. V. Jailaxmi & R. Arumuganathan & M. Senthil Kumar, 2017. "Performance analysis of an M/G/1 retrial queue with general retrial time, modified M-vacations and collision," Operational Research, Springer, vol. 17(2), pages 649-667, July.
    11. Renbin Liu & Attahiru Sule Alfa & Miaomiao Yu, 2019. "Analysis of an ND-policy Geo/G/1 queue and its application to wireless sensor networks," Operational Research, Springer, vol. 19(2), pages 449-477, June.
    12. P. Rajadurai & V. M. Chandrasekaran & M. C. Saravanarajan, 2016. "Analysis of an M[X]/G/1 unreliable retrial G-queue with orbital search and feedback under Bernoulli vacation schedule," OPSEARCH, Springer;Operational Research Society of India, vol. 53(1), pages 197-223, March.
    13. Atencia, I., 2017. "A Geo/G/1 retrial queueing system with priority services," European Journal of Operational Research, Elsevier, vol. 256(1), pages 178-186.
    14. Sanga, Sudeep Singh & Jain, Madhu, 2019. "Cost optimization and ANFIS computing for admission control of M/M/1/K queue with general retrial times and discouragement," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    15. Dimitris Bertsimas & José Niño-Mora, 1996. "Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case," Economics Working Papers 314, Department of Economics and Business, Universitat Pompeu Fabra, revised Aug 1998.
    16. Ioannis Dimitriou, 2016. "A queueing model with two classes of retrial customers and paired services," Annals of Operations Research, Springer, vol. 238(1), pages 123-143, March.
    17. Dimitris Bertsimas & José Niño-Mora, 1999. "Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 306-330, May.
    18. Priyanka Kalita & Gautam Choudhury & Dharmaraja Selvamuthu, 2020. "Analysis of Single Server Queue with Modified Vacation Policy," Methodology and Computing in Applied Probability, Springer, vol. 22(2), pages 511-553, June.
    19. Benjamin Legros & Sihan Ding & Rob Mei & Oualid Jouini, 2017. "Call centers with a postponed callback offer," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1097-1125, October.
    20. Mehmet Tolga Cezik & Pierre L'Ecuyer, 2008. "Staffing Multiskill Call Centers via Linear Programming and Simulation," Management Science, INFORMS, vol. 54(2), pages 310-323, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:21:y:2013:i:3:p:542-571. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.