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

Preemptive Priority Queues

Author

Listed:
  • Wei Chang

    (IBM Corporation, Kingston, New York)

Abstract

Customers of different priorities arrive at a counter in accordance with a Poisson process. The customers are served by a single server in order of priority and for each priority in order of arrival. Preemptive discipline is assumed. Three service policies are considered: (i) preemptive-resume, (ii) preemptive-repeat-identical, and (iii) preemptive-repeat-different. The time-dependent solutions for these priority systems are very complicated. However, the problem can be simplified in case of stationary solutions. In this paper, a step-by-step method is proposed to find the stationary distributions of the queue sizes, the waiting times, and the busy periods of each priority class.

Suggested Citation

  • Wei Chang, 1965. "Preemptive Priority Queues," Operations Research, INFORMS, vol. 13(5), pages 820-827, October.
    • Handle: RePEc:inm:oropre:v:13:y:1965:i:5:p:820-827
    DOI: 10.1287/opre.13.5.820
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.13.5.820
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.13.5.820?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. Jayaswal, Sachin & Vidyarthi, Navneet, 2013. "Capacitated Multiple Allocation Hub Location with Service Level Constraints for Multiple Consignment Classes," IIMA Working Papers WP2013-11-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    2. Jayaswal, Sachin & Jewkes, Elizabeth & Ray, Saibal, 2011. "Product differentiation and operations strategy in a capacitated environment," European Journal of Operational Research, Elsevier, vol. 210(3), pages 716-728, May.
    3. Steve Drekic & David A. Stanford, 2001. "Reducing Delay in Preemptive Repeat Priority Queues," Operations Research, INFORMS, vol. 49(1), pages 145-156, February.

    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:13:y:1965:i:5:p:820-827. 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.