IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v50y2021i14p3235-3248.html
   My bibliography  Save this article

Solution of an M/G/1 queueing model with k sequential heterogeneous service steps and vacations using the Tauberian property

Author

Listed:
  • Ali Mohammadi
  • Mohammad Reza Salehi Rad

Abstract

This article studies a transient M/G/1 queueing model with k sequential heterogeneous service steps and vacations. Entrants arrive according to a Poisson process, and each arrival is serviced sequentially and consistently in k phases in the order of arrival. The service times follow a general distribution function. Upon completion of the service, the server could take a vacation with the probability θ and remains in the system to provide service to other customers with the probability 1−θ. For this model, first, we obtain the Laplace transform of the probability generating functions (PGFs) of system size, and then we obtain the PGFs for a special case in the transient state, and the corresponding steady state results explicitly. Also, we derive the system performance measures such as the means system size, waiting time, and busy period in a closed form.

Suggested Citation

  • Ali Mohammadi & Mohammad Reza Salehi Rad, 2021. "Solution of an M/G/1 queueing model with k sequential heterogeneous service steps and vacations using the Tauberian property," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 50(14), pages 3235-3248, July.
    • Handle: RePEc:taf:lstaxx:v:50:y:2021:i:14:p:3235-3248
    DOI: 10.1080/03610926.2019.1691232
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2019.1691232
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2019.1691232?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.

    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:taf:lstaxx:v:50:y:2021:i:14:p:3235-3248. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.