Balancing of the C-mu rule by intermediate priorities

Moshe Haviv ()
Additional contact information
Moshe Haviv: The Chinese University of Hong Kong

Queueing Systems: Theory and Applications, 2025, vol. 109, issue 3, No 2, 21 pages

Abstract: 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.

Keywords: Priority queues; Constraint optimization; Intermediate priorities; 90B22 (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-025-09946-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:109:y:2025:i:3:d:10.1007_s11134-025-09946-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-025-09946-1

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().