IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v87y1999i0p333-35010.1023-a1018997322610.html
   My bibliography  Save this article

A multi‐class cyclic arrival queue with a single server

Author

Listed:
  • H. Zhang

Abstract

Motivated by cyclic scheduling in the presence of random machine failures, this paper studies the following queueing system. A single server serves customers from n classes who arrive in a cyclic manner: after the arrival of a customer from class i, the next arriving customer is from class i + 1 (modulo n). The interarrival times between classes and the service times may have different distributions for different classes. All service times and interarrival times are independent of one another. Arrivals form a single queue and the service discipline is first-come first‐served (FCFS). This paper presents an algorithm that finds the waiting time distribution for each customer class under the condition that all service times have rational Laplace transforms. A variety of examples are presented. Exponentiality of the waiting time under heavy traffic is proven. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • H. Zhang, 1999. "A multi‐class cyclic arrival queue with a single server," Annals of Operations Research, Springer, vol. 87(0), pages 333-350, April.
    • Handle: RePEc:spr:annopr:v:87:y:1999:i:0:p:333-350:10.1023/a:1018997322610
    DOI: 10.1023/A:1018997322610
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Alexander Moiseev & Maria Shklennik & Evgeny Polin, 2023. "Infinite-server queueing tandem with Markovian arrival process and service depending on its state," Annals of Operations Research, Springer, vol. 326(1), pages 261-279, July.

    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:spr:annopr:v:87:y:1999:i:0:p:333-350:10.1023/a:1018997322610. 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: 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.