IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v109y2025i3d10.1007_s11134-025-09946-1.html
   My bibliography  Save this article

Balancing of the C-mu rule by intermediate priorities

Author

Listed:
  • Moshe Haviv

    (The Chinese University of Hong Kong
    The Hebrew University of Jerusalem)

Abstract

The $$C\mu $$ C μ -rule is well known to be socially optimal in the sense that it minimizes the overall mean waiting costs due to queueing. Yet, this rule is blind to fairness. In particular, it is possible that those with a high cost of wait per unit of time not only enjoy priority over other customers (which is acceptable) but may also end up incurring less waiting costs than those with a corresponding low parameter (which is less acceptable). We suggest a fairer scheme which minimizes the overall cost under the constraint that this anomaly does not exist. It is based on partitioning customers’ classes into leagues, such that absolute priority is granted among the leagues a-la the $$C\mu $$ C μ -rule, while within leagues intermediate priorities, such as accumulated priorities, are used. Toward that end, we revisited some results on such priority schemes and derived some new ones.

Suggested Citation

  • Moshe Haviv, 2025. "Balancing of the C-mu rule by intermediate priorities," Queueing Systems: Theory and Applications, Springer, vol. 109(3), pages 1-21, September.
    • Handle: RePEc:spr:queues:v:109:y:2025:i:3:d:10.1007_s11134-025-09946-1
    DOI: 10.1007/s11134-025-09946-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-025-09946-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-025-09946-1?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:queues:v:109:y:2025:i:3:d:10.1007_s11134-025-09946-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.