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

Heavy Traffic Response Times for a Priority Queue with Linear Priorities

Author

Listed:
  • Randolph D. Nelson

    (IBM Thomas J. Watson Research Center, Yorktown Heights, New York)

Abstract

This paper analyzes a queueing system consisting of a single server which dispenses service to jobs of K ≥ 1 priority classes. Jobs are assumed to arrive to the queue according to a Poisson point process with a class dependent rate and to have class dependent service demands that are generally distributed. A linear priority function of the time spent in the system is specified for each job class and is used to schedule jobs. Specifically, the server, when available for service, nonpreemptively selects the job having the highest priority value to be the next job scheduled. Previous work in analyzing a system of this type has concentrated on providing bounds on the expected class response time. We extend these results by providing a closed form expression for the mean class response time and an expression for the ratio of expected response times in the limiting case of heavy traffic. We also provide a closed form expression for the mean class response time under certain light load conditions.

Suggested Citation

  • Randolph D. Nelson, 1990. "Heavy Traffic Response Times for a Priority Queue with Linear Priorities," Operations Research, INFORMS, vol. 38(3), pages 560-563, June.
    • Handle: RePEc:inm:oropre:v:38:y:1990:i:3:p:560-563
    DOI: 10.1287/opre.38.3.560
    as

    Download full text from publisher

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

    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:38:y:1990:i:3:p:560-563. 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.