IDEAS home Printed from https://ideas.repec.org/a/hin/jijmms/547610.html
   My bibliography  Save this article

A queueing system with a fixed accumulation level, random server capacity and capacity dependent service time

Author

Listed:
  • Jewgeni H. Dshalalow
  • Lotfi Tadj

Abstract

This paper introduces a bulk queueing system with a single server processing groups of customers of a variable size. If upon completion of service the queueing level is at least r the server takes a batch of size r and processes it a random time arbitrarily distributed. If the queueing level is less than r the server idles until the queue accumulates r customers in total. Then the server capacity is generated by a random number equals the batch size taken for service which lasts an arbitrarily distributed time dependent on the batch size. The objective of the paper is the stationary distribution of queueing process which is studied via semi-regenerative techniques. An ergodicity criterion for the process is established and an explicit formula for the generating function of the distribution is obtained.

Suggested Citation

  • Jewgeni H. Dshalalow & Lotfi Tadj, 1992. "A queueing system with a fixed accumulation level, random server capacity and capacity dependent service time," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 15, pages 1-6, January.
    • Handle: RePEc:hin:jijmms:547610
    DOI: 10.1155/S0161171292000218
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/IJMMS/15/547610.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/IJMMS/15/547610.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/S0161171292000218?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
    ---><---

    Citations

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


    Cited by:

    1. Veena Goswami & Mohan Chaudhry & Abhijit Datta Banik, 2022. "Sojourn-time Distribution for $$M/G^a/1$$ M / G a / 1 Queue with Batch Service of Fixed Size - Revisited," Methodology and Computing in Applied Probability, Springer, vol. 24(4), pages 2897-2912, December.

    More about this item

    Statistics

    Access and download statistics

    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:hin:jijmms:547610. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.