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

Optimal Priority Assignment with Heterogeneous Waiting Costs

Author

Listed:
  • Avraham Beja

    (Tel-Aviv University, Tel-Aviv, Israel)

  • Esther Sid

    (Tel-Aviv University, Tel-Aviv, Israel)

Abstract

For an M / G /1 queuing system, this paper assumes (l) that the discipline is administratively constrained to a “head-of-the-line” rule with n classes, and (2) that priorities are centrally assigned to customers according to their individual cost per unit time spent in the system, or their individual service-time requirements, or both (as the available information may be), but independently of the state of the queue. Then optimal priority-assignment rules for the various information structures are characterized. When n = 2, the higher priority may always be optimally assigned to all customers who are “no worse than average” and with sufficiently high load to “practically all” customers.

Suggested Citation

  • Avraham Beja & Esther Sid, 1975. "Optimal Priority Assignment with Heterogeneous Waiting Costs," Operations Research, INFORMS, vol. 23(1), pages 107-117, February.
    • Handle: RePEc:inm:oropre:v:23:y:1975:i:1:p:107-117
    DOI: 10.1287/opre.23.1.107
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.23.1.107
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.23.1.107?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. Rao & E. R. Petersen, 1998. "Optimal Pricing of Priority Services," Operations Research, INFORMS, vol. 46(1), pages 46-56, 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:23:y:1975:i:1:p:107-117. 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.