When does partial priority improve revenue?
Open Access
- 19 January 2026
- journal article
- research article
- Published by Springer Nature in Queueing Systems
- Vol. 110 (1) , 9
Abstract
Priority queues have long been used to increase revenue by exploiting the fact that time-sensitive customers are willing to pay for shorter waiting times. This fact begs the question: Can one make even more revenue by relaxing the strictness of the priority policy? This paper answers this question under the unobservable queue setting, where customers are heterogeneous in their time-sensitivity; specifically the time-sensitivity of customers is allowed to follow an arbitrary distribution. In this paper, we prove necessary and sufficient conditions under which partial priority can increase the revenue. Specifically, we find a surprising result: Although partial priority offers much more flexibility than strict priority, partial priority only increases revenue if there are two additional constraints on the service provider, one setting a maximum price and the other setting a maximum waiting time. In the absence of either of these constraints, we prove that strict priority maximizes revenue. Finally, in situations where partial priority increases the revenue, we analytically characterize the amount of improvement.Keywords
Funding Information
- National Science Foundation (NSF-CIF-2403194)
- National Science Foundation (NSF-III-2322973)
- National Science Foundation (NSF-CMMI-OE-2307008)
- Carnegie Mellon University
This publication has 36 references indexed in Scilit:
- Charging more for priority via two-part tariff for accumulating prioritiesEuropean Journal of Operational Research, 2022
- An optimal mechanism charging for priority in a queueOperations Research Letters, 2020
- Strategic bidding in an accumulating priority queue: equilibrium analysisAnnals of Operations Research, 2016
- Waiting time distributions in the accumulating priority queueQueueing Systems, 2013
- Dynamic pricing and scheduling in a multi-class single-server queueing systemQueueing Systems, 2011
- The use of relative priorities in optimizing the performance of a queueing systemEuropean Journal of Operational Research, 2009
- Waiting times in queues with relative prioritiesOperations Research Letters, 2007
- Who should be given priority in a queue?Operations Research Letters, 2006
- To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems2003
- A probabilistic priority scheduling discipline for multi-service networksComputer Communications, 2002