IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v141y2006i1p109-13710.1007-s10479-006-5296-6.html
   My bibliography  Save this article

On bulk-service MAP/PH L,N /1/N G-Queues with repeated attempts

Author

Listed:
  • F. Avram
  • A. Gómez-Corral

Abstract

We consider a retrial queue with a finite buffer of size N, with arrivals of ordinary units and of negative units (which cancel one ordinary unit), both assumed to be Markovian arrival processes. The service requirements are of phase type. In addition, a PH L,N bulk service discipline is assumed. This means that the units are served in groups of size at least L, where 1≤ L≤ N. If at the completion of a service fewer than L units are present at the buffer, the server switches off and waits until the buffer length reaches the threshold L. Then it switches on and initiates service for such a group of units. On the contrary, if at the completion of a service L or more units are present at the buffer, all units enter service as a group. Units arriving when the buffer is full are not lost, but they join a group of unsatisfied units called “orbit”. Our interest is in the continuous-time Markov chain describing the state of the queue at arbitrary times, which constitutes a level dependent quasi-birth-and-death process. We start by analyzing a simplified version of our queueing model, which is amenable to numerical calculation and is based on spatially homogeneous quasi-birth-and-death processes. This leads to modified matrix-geometric formulas that reveal the basic qualitative properties of our algorithmic approach for computing performance measures. Copyright Springer Science + Business Media, Inc. 2006

Suggested Citation

  • 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.
  • Handle: RePEc:spr:annopr:v:141:y:2006:i:1:p:109-137:10.1007/s10479-006-5296-6
    DOI: 10.1007/s10479-006-5296-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-5296-6
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-006-5296-6?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. 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. Sergei Dudin & Olga Dudina, 2023. "Analysis of a Multi-Server Queue with Group Service and Service Time Dependent on the Size of a Group as a Model of a Delivery System," Mathematics, MDPI, vol. 11(22), pages 1-20, November.

    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. 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.
    2. 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.
    3. Nitin Kumar & F. P. Barbhuiya & U. C. Gupta, 2020. "Unified killing mechanism in a single server queue with renewal input," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 246-259, March.
    4. Sayarshad, Hamid R. & Du, Xinpi & Gao, H. Oliver, 2020. "Dynamic post-disaster debris clearance problem with re-positioning of clearance equipment items under partially observable information," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 352-372.
    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. Junping Li, 2024. "Birth–Death Processes with Two-Type Catastrophes," Mathematics, MDPI, vol. 12(10), pages 1-17, May.
    7. 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.
    8. Altay, Nezih & Green III, Walter G., 2006. "OR/MS research in disaster operations management," European Journal of Operational Research, Elsevier, vol. 175(1), pages 475-493, November.
    9. 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.
    10. 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.
    11. Chi, Hong & Li, Jialian & Shao, Xueyan & Gao, Mingang, 2017. "Timeliness evaluation of emergency resource scheduling," European Journal of Operational Research, Elsevier, vol. 258(3), pages 1022-1032.
    12. Jean-Michel Fourneau & Erol Gelenbe, 2017. "G-Networks with Adders," Future Internet, MDPI, vol. 9(3), pages 1-7, July.
    13. A. Gómez-Corral & M. E. Martos, 2009. "Marked Markovian Arrivals in a Tandem G-Network with Blocking," Methodology and Computing in Applied Probability, Springer, vol. 11(4), pages 621-649, December.
    14. Caunhye, Aakil M. & Nie, Xiaofeng & Pokharel, Shaligram, 2012. "Optimization models in emergency logistics: A literature review," Socio-Economic Planning Sciences, Elsevier, vol. 46(1), pages 4-13.
    15. 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.
    16. Gopinath Panda & Veena Goswami, 2022. "Equilibrium Joining Strategies of Positive Customers in a Markovian Queue with Negative Arrivals and Working Vacations," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1439-1466, September.
    17. Arnon Arazi & Eshel Ben-Jacob & Uri Yechiali, 2005. "Controlling an oscillating Jackson-type network having state-dependent service rates," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(3), pages 453-466, December.
    18. 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.
    19. Leite, Saul C. & Fragoso, Marcelo D., 2013. "Diffusion approximation for signaling stochastic networks," Stochastic Processes and their Applications, Elsevier, vol. 123(8), pages 2957-2982.
    20. B. Kumar & D. Arivudainambi & A. Krishnamoorthy, 2006. "Some results on a generalized M/G/1 feedback queue with negative customers," Annals of Operations Research, Springer, vol. 143(1), pages 277-296, March.

    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:annopr:v:141:y:2006:i:1:p:109-137:10.1007/s10479-006-5296-6. 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.