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

Multi-threshold control of the B M A P / S M / 1 / K queue with group services

Author

Listed:
  • Alexander N. Dudin
  • Srinivas R. Chakravarthy

Abstract

We consider a finite capacity queue in which arrivals occur according to a batch Markovian arrival process ( B M A P ) . The customers are served in groups of varying sizes. The services are governed by a controlled semi-Markovian process according to a multithreshold strategy. We perform the steady-state analysis of this model by computing (a) the queue length distributions at departure and arbitrary epochs, (b) the Laplace-Stieltjes transform of the sojourn time distribution of an admitted customer, and (c) some selected system performance measures. An optimization problem of interest is presented and some numerical examples are illustrated.

Suggested Citation

  • Alexander N. Dudin & Srinivas R. Chakravarthy, 2003. "Multi-threshold control of the B M A P / S M / 1 / K queue with group services," International Journal of Stochastic Analysis, Hindawi, vol. 16, pages 1-21, January.
    • Handle: RePEc:hin:jnijsa:276047
    DOI: 10.1155/S1048953303000261
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/IJSA/16/276047.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/IJSA/16/276047.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/S1048953303000261?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. Srinivas R. Chakravarthy & Shruti & Alexander Rumyantsev, 2021. "Analysis of a Queueing Model with Batch Markovian Arrival Process and General Distribution for Group Clearance," Methodology and Computing in Applied Probability, Springer, vol. 23(4), pages 1551-1579, 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:jnijsa:276047. 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.