IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v17y1969i6p1077-1089.html
   My bibliography  Save this article

A Time-Sharing Model with Many Queues

Author

Listed:
  • I. Adiri

    (Technion—Israel Institute of Technology, Haifa, Israel)

  • B. Avi-Itzhak

    (Technion—Israel Institute of Technology, Haifa, Israel)

Abstract

This paper presents a mathematical study of a time-sharing system with a single server and many queues. In each queue a customer receives one quantum of service and is then sent to the end of the next queue, provided his service demand has not been completely satisfied. When a quantum of service is completed, the server attends to the first customer in the lowest-index nonempty queue. The discipline of the highest indexed queue is “round-robin,” while all other queues obey the FIFO rule. Newly arrived customers join the end of the first queue. The paper derives mathematical expressions for the main performance measures and illustrates them by graphical means.

Suggested Citation

  • I. Adiri & B. Avi-Itzhak, 1969. "A Time-Sharing Model with Many Queues," Operations Research, INFORMS, vol. 17(6), pages 1077-1089, December.
    • Handle: RePEc:inm:oropre:v:17:y:1969:i:6:p:1077-1089
    DOI: 10.1287/opre.17.6.1077
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.17.6.1077
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.17.6.1077?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
    ---><---

    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:inm:oropre:v:17:y:1969:i:6:p:1077-1089. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.