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

Preemptive Repeat Priority Queues as a Special Case of the Multipurpose Server Problem---I

Author

Listed:
  • B. Avi-Itzhak

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

Abstract

A single station provides service to customers who arrive in a Poisson stream with constant intensity. All the customers require an equal and fixed amount of service but the servicing rate of the station varies randomly, and thus the resulting service time is randomly distributed. The service station itself is subject to random breakdowns rendering it inoperative for random periods of time during which repairs take place. The service of a customer, displaced by a breakdown, is repeated from the beginning as boon as the repair process is completed. The service given to the customer prior to his displacement is wasted. It is shown that this model describes a situation where displacement is not necessarily a result of breakdowns, but may well be caused by other, more urgent, tasks which have to be performed by the station. Some characteristics of the model, such as the expected queue length and queuing time are derived. A solution is given for the preemptive repeat queuing problem as a special case of this model.

Suggested Citation

  • B. Avi-Itzhak, 1963. "Preemptive Repeat Priority Queues as a Special Case of the Multipurpose Server Problem---I," Operations Research, INFORMS, vol. 11(4), pages 597-609, August.
    • Handle: RePEc:inm:oropre:v:11:y:1963:i:4:p:597-609
    DOI: 10.1287/opre.11.4.597
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.11.4.597
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.11.4.597?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. Søren Asmussen & Peter W. Glynn, 2017. "On preemptive-repeat LIFO queues," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 1-22, October.

    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:11:y:1963:i:4:p:597-609. 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.