IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v319y2018icp245-253.html
   My bibliography  Save this article

A Geo[X]/G[X]/1 retrial queueing system with removal work and total renewal discipline

Author

Listed:
  • Atencia-Mc.Killop, Ivan
  • Galán-García, José L.
  • Aguilera-Venegas, Gabriel
  • Rodríguez-Cielos, Pedro
  • Galán-García, MÁngeles

Abstract

In this paper we consider a discrete-time retrial queueing system with batch arrivals of geometric type and general batch services. The arriving group of customers can decide to go directly to the server expelling out of the system the batch of customers that is currently being served, if any, or to join the orbit. After a successful retrial all the customers in the orbit get service simultaneously. An extensive analysis of the model is carried out, and using a generating functions approach some performance measures of the model, such as the first distribution’s moments of the number of customers in the orbit and in the system, are obtained. The generating functions of the sojourn time of a customer in the orbit and in the system are also given. Finally, in the section of conclusions and research results the main contributions of the paper are commented.

Suggested Citation

  • Atencia-Mc.Killop, Ivan & Galán-García, José L. & Aguilera-Venegas, Gabriel & Rodríguez-Cielos, Pedro & Galán-García, MÁngeles, 2018. "A Geo[X]/G[X]/1 retrial queueing system with removal work and total renewal discipline," Applied Mathematics and Computation, Elsevier, vol. 319(C), pages 245-253.
    • Handle: RePEc:eee:apmaco:v:319:y:2018:i:c:p:245-253
    DOI: 10.1016/j.amc.2017.02.032
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317301364
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.02.032?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. Harrison White & Lee S. Christie, 1958. "Queuing with Preemptive Priorities or with Breakdown," Operations Research, INFORMS, vol. 6(1), pages 79-95, February.
    2. A. Krishnamoorthy & P. Pramod & S. Chakravarthy, 2014. "Queues with interruptions: a survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 290-320, April.
    3. I. Atencia & A. Pechinkin, 2013. "A discrete-time queueing system with optional LCFS discipline," Annals of Operations Research, Springer, vol. 202(1), pages 3-17, January.
    4. 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.
    5. Dieter Fiems & Bart Steyaert & Herwig Bruneel, 2002. "Randomly Interrupted GI-G-1 Queues: Service Strategies and Stability Issues," Annals of Operations Research, Springer, vol. 112(1), pages 171-183, April.
    6. Gelenbe, Erol & Labed, Ali, 1998. "G-networks with multiple classes of signals and positive customers," European Journal of Operational Research, Elsevier, vol. 108(2), pages 293-305, July.
    7. Joris Walraevens & Bart Steyaert & Herwig Bruneel, 2006. "A preemptive repeat priority queue with resampling: Performance analysis," Annals of Operations Research, Springer, vol. 146(1), pages 189-202, September.
    8. Artalejo, J. R., 2000. "G-networks: A versatile approach for work removal in queueing networks," European Journal of Operational Research, Elsevier, vol. 126(2), pages 233-249, October.
    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. 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.

    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. 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.
    2. I. Atencia, 2015. "A discrete-time queueing system with server breakdowns and changes in the repair times," Annals of Operations Research, Springer, vol. 235(1), pages 37-49, December.
    3. Sheng Zhu & Jinting Wang & Bin Liu, 2020. "Equilibrium joining strategies in the Mn/G/1 queue with server breakdowns and repairs," Operational Research, Springer, vol. 20(4), pages 2163-2187, December.
    4. 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.
    5. Jean-Michel Fourneau & Erol Gelenbe, 2017. "G-Networks with Adders," Future Internet, MDPI, vol. 9(3), pages 1-7, July.
    6. Zamani, Shokufeh & Arkat, Jamal & Niaki, Seyed Taghi Akhavan, 2022. "Service interruption and customer withdrawal in the congested facility location problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    7. Ivan Atencia & José Luis Galán-García, 2021. "Sojourn Times in a Queueing System with Breakdowns and General Retrial Times," Mathematics, MDPI, vol. 9(22), pages 1-25, November.
    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. Herwig Bruneel & Dieter Fiems & Joris Walraevens & Sabine Wittevrongel, 2014. "Queueing models for the analysis of communication systems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 421-448, July.
    10. Balsamo, Simonetta & Marin, Andrea, 2013. "Separable solutions for Markov processes in random environments," European Journal of Operational Research, Elsevier, vol. 229(2), pages 391-403.
    11. A. Krishnamoorthy & P. Pramod & S. Chakravarthy, 2014. "Queues with interruptions: a survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 290-320, April.
    12. A Rodrigo & M Vazquez & C Carrera, 2006. "Markovian networks in labour markets," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(5), pages 526-531, May.
    13. Artalejo, J. R., 2000. "G-networks: A versatile approach for work removal in queueing networks," European Journal of Operational Research, Elsevier, vol. 126(2), pages 233-249, October.
    14. V. Radhamani & B. Sivakumar & G. Arivarignan, 2022. "A Comparative Study on Replenishment Policies for Perishable Inventory System with Service Facility and Multiple Server Vacation," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 229-265, March.
    15. Divya Velayudhan Nair & Achyutha Krishnamoorthy & Agassi Melikov & Sevinj Aliyeva, 2021. "MMAP/(PH,PH)/1 Queue with Priority Loss through Feedback," Mathematics, MDPI, vol. 9(15), pages 1-26, July.
    16. Muthukrishnan Senthil Kumar & Aresh Dadlani & Kiseon Kim, 2020. "Performance analysis of an unreliable M/G/1 retrial queue with two-way communication," Operational Research, Springer, vol. 20(4), pages 2267-2280, December.
    17. Y. Wang, 2006. "Numerical Modelling of Autonomous Agent Movement and Conflict," Computational Management Science, Springer, vol. 3(3), pages 207-223, July.
    18. 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.
    19. Bi, Huibo & Shang, Wen-Long & Chen, Yanyan & Wang, Kezhi & Yu, Qing & Sui, Yi, 2021. "GIS aided sustainable urban road management with a unifying queueing and neural network model," Applied Energy, Elsevier, vol. 291(C).
    20. F. Avram & A. Gómez-Corral, 2006. "On bulk-service MAP/PH L,N /1/N G-Queues with repeated attempts," Annals of Operations Research, Springer, vol. 141(1), pages 109-137, January.

    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:eee:apmaco:v:319:y:2018:i:c:p:245-253. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.