IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v17y1971i7p463-471.html
   My bibliography  Save this article

Queue Length Dependent Priority Queues

Author

Listed:
  • K. R. Balachandran

    (The University of Wisconsin-Milwaukee)

Abstract

Priority rules that are mixtures of pre-emption and postponable rules are analyzed. Whether a pre-emption occurs is made to depend on some factor in addition to priority class. A lower priority customer is pre-empted if and only if the queue length of higher priority customers is N, a decision parameter. The stochastic model (without priorities) is that of the M/G/1 queue. First moment expressions (e.g., expected number of customers in the system) in the steady state case are obtained for each priority class, using the concept of work conservation. A linear cost model is introduced which is a function of expected waiting time and expected number of pre-emptions. By considering a parametric class of rules determined by the decision parameter, the problem of finding an optimal rule is formulated.

Suggested Citation

  • K. R. Balachandran, 1971. "Queue Length Dependent Priority Queues," Management Science, INFORMS, vol. 17(7), pages 463-471, March.
    • Handle: RePEc:inm:ormnsc:v:17:y:1971:i:7:p:463-471
    DOI: 10.1287/mnsc.17.7.463
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.17.7.463
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.17.7.463?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:ormnsc:v:17:y:1971:i:7:p:463-471. 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.