{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:00:50Z","timestamp":1774987250487,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:00:00Z","timestamp":1768780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:00:00Z","timestamp":1768780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF-CIF-2403194"],"award-info":[{"award-number":["NSF-CIF-2403194"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF-III-2322973"],"award-info":[{"award-number":["NSF-III-2322973"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF-CMMI-OE-2307008"],"award-info":[{"award-number":["NSF-CMMI-OE-2307008"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008047","name":"Carnegie Mellon University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100008047","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>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.<\/jats:p>","DOI":"10.1007\/s11134-025-09968-9","type":"journal-article","created":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T12:45:55Z","timestamp":1768826755000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["When does partial priority improve revenue?"],"prefix":"10.1007","volume":"110","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-1839-3715","authenticated-orcid":false,"given":"Zhouzi","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mor","family":"Harchol-Balter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Scheller-Wolf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,19]]},"reference":[{"issue":"1","key":"9968_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1287\/mnsc.41.1.163","volume":"41","author":"R Hassin","year":"1995","unstructured":"Hassin, R.: Decentralized regulation of a queue. Manage. Sci. 41(1), 163\u2013173 (1995)","journal-title":"Manage. Sci."},{"issue":"3","key":"9968_CR2","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1287\/msom.1080.0226","volume":"11","author":"VN Hsu","year":"2009","unstructured":"Hsu, V.N., Xu, S.H., Jukic, B.: Optimal scheduling and incentive compatible pricing for a service system with quality of service guarantees. Manuf. Serv. Oper. Manag. 11(3), 375\u2013396 (2009)","journal-title":"Manuf. Serv. Oper. Manag."},{"issue":"3","key":"9968_CR3","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.orl.2020.03.010","volume":"48","author":"M Haviv","year":"2020","unstructured":"Haviv, M., Winter, E.: An optimal mechanism charging for priority in a queue. Oper. Res. Lett. 48(3), 304\u2013308 (2020)","journal-title":"Oper. Res. Lett."},{"key":"9968_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0359-0","volume-title":"To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems","author":"R Hassin","year":"2003","unstructured":"Hassin, R., Haviv, M.: To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems, vol. 59. Springer, New York (2003)"},{"issue":"5","key":"9968_CR5","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1287\/opre.38.5.870","volume":"38","author":"H Mendelson","year":"1990","unstructured":"Mendelson, H., Whang, S.: Optimal incentive-compatible priority pricing for the M\/M\/1 queue. Oper. Res. 38(5), 870\u2013883 (1990)","journal-title":"Oper. Res."},{"issue":"5","key":"9968_CR6","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1287\/mnsc.34.5.666","volume":"34","author":"H Alperstein","year":"1988","unstructured":"Alperstein, H.: Note-optimal pricing policy for the service facility offering a set of priority prices. Manage. Sci. 34(5), 666\u2013671 (1988)","journal-title":"Manage. Sci."},{"issue":"3\u2013part\u2013ii","key":"9968_CR7","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1287\/opre.28.3.810","volume":"28","author":"EG Coffman Jr","year":"1980","unstructured":"Coffman, E.G., Jr., Mitrani, I.: A characterization of waiting time performance realizable by single-server queues. Oper. Res. 28(3\u2013part\u2013ii), 810\u2013821 (1980)","journal-title":"Oper. Res."},{"issue":"5","key":"9968_CR8","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1287\/opre.36.5.733","volume":"36","author":"A Federgruen","year":"1988","unstructured":"Federgruen, A., Groenevelt, H.: Characterization and optimization of achievable performance in general queueing systems. Oper. Res. 36(5), 733\u2013741 (1988)","journal-title":"Oper. Res."},{"issue":"3","key":"9968_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1287\/opre.45.3.407","volume":"45","author":"PJ Lederer","year":"1997","unstructured":"Lederer, P.J., Li, L.: Pricing, production, scheduling, and delivery-time competition. Oper. Res. 45(3), 407\u2013420 (1997)","journal-title":"Oper. Res."},{"issue":"4","key":"9968_CR10","first-page":"1184","volume":"67","author":"P Afeche","year":"2019","unstructured":"Afeche, P., Baron, O., Milner, J., Roet-Green, R.: Pricing and prioritizing time-sensitive customers with heterogeneous demand rates. Oper. Res. 67(4), 1184\u20131208 (2019)","journal-title":"Oper. Res."},{"key":"9968_CR11","unstructured":"Katta, A.-K., Sethuraman, J.: Pricing Strategies and Service Differentiation in Queues\u2014A Profit Maximization Perspective. Department of Industrial Engineering and Operations Research, Columbia University (2005)"},{"issue":"5","key":"9968_CR12","doi-asserted-by":"publisher","first-page":"2427","DOI":"10.1287\/mnsc.2016.2713","volume":"64","author":"C Maglaras","year":"2018","unstructured":"Maglaras, C., Yao, J., Zeevi, A.: Optimal price and delay differentiation in large-scale queueing systems. Manage. Sci. 64(5), 2427\u20132444 (2018)","journal-title":"Manage. Sci."},{"issue":"3","key":"9968_CR13","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1287\/mnsc.2017.2987","volume":"65","author":"I Gurvich","year":"2019","unstructured":"Gurvich, I., Lariviere, M.A., Ozkan, C.: Coverage, coarseness, and classification: determinants of social efficiency in priority queues. Manage. Sci. 65(3), 1061\u20131075 (2019)","journal-title":"Manage. Sci."},{"issue":"8","key":"9968_CR14","doi-asserted-by":"publisher","first-page":"2412","DOI":"10.1287\/mnsc.2015.2236","volume":"62","author":"P Afeche","year":"2016","unstructured":"Afeche, P., Pavlin, J.M.: Optimal price\/lead-time menus for queues with customer choice: segmentation, pooling, and strategic delay. Manage. Sci. 62(8), 2412\u20132436 (2016)","journal-title":"Manage. Sci."},{"issue":"3","key":"9968_CR15","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1287\/msom.2013.0449","volume":"15","author":"P Afeche","year":"2013","unstructured":"Afeche, P.: Incentive-compatible revenue management in queueing systems: optimal strategic delay. Manuf. Serv. Oper. Manage. 15(3), 423\u2013443 (2013)","journal-title":"Manuf. Serv. Oper. Manage."},{"issue":"2","key":"9968_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.orl.2005.04.007","volume":"34","author":"R Hassin","year":"2006","unstructured":"Hassin, R., Haviv, M.: Who should be given priority in a queue? Oper. Res. Lett. 34(2), 191\u2013198 (2006)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"9968_CR17","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.orl.2006.10.003","volume":"35","author":"M Haviv","year":"2007","unstructured":"Haviv, M., van der Wal, J.: Waiting times in queues with relative priorities. Oper. Res. Lett. 35(5), 591\u2013594 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9968_CR18","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/j.ejor.2007.11.058","volume":"193","author":"R Hassin","year":"2009","unstructured":"Hassin, R., Puerto, J., Fern\u00e1ndez, F.R.: The use of relative priorities in optimizing the performance of a queueing system. Eur. J. Oper. Res. 193(2), 476\u2013483 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9968_CR19","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s10479-016-2141-4","volume":"244","author":"M Haviv","year":"2016","unstructured":"Haviv, M., Ravner, L.: Strategic bidding in an accumulating priority queue: equilibrium analysis. Ann. Oper. Res. 244(2), 505\u2013523 (2016)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9968_CR20","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1016\/j.ejor.2022.04.042","volume":"304","author":"S Moshe","year":"2023","unstructured":"Moshe, S., Oz, B.: Charging more for priority via two-part tariff for accumulating priorities. Eur. J. Oper. Res. 304(2), 652\u2013660 (2023)","journal-title":"Eur. J. Oper. Res."},{"key":"9968_CR21","unstructured":"Disney Lightning Lane Passes. https:\/\/disneyworld.disney.go.com\/lightning-lane-passes\/"},{"key":"9968_CR22","unstructured":"Overview of Disney World Lightning Lane Passes. https:\/\/www.undercovertourist.com\/blog\/disney-world-lightning-lane\/"},{"key":"9968_CR23","unstructured":"Even Disney Is Worried About the High Cost of a Disney Vacation. https:\/\/www.msn.com\/en-us\/travel\/news\/even-disney-is-worried-about-the-high-cost-of-a-disney-vacation\/ar-AA1yFRdv"},{"key":"9968_CR24","doi-asserted-by":"crossref","unstructured":"Naor, P.: The regulation of queue size by levying tolls. Econom.: J. Econom. Soc. 15\u201324 (1969)","DOI":"10.2307\/1909200"},{"issue":"8","key":"9968_CR25","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1287\/mnsc.1080.0867","volume":"54","author":"LG Debo","year":"2008","unstructured":"Debo, L.G., Toktay, L.B., Van Wassenhove, L.N.: Queuing for expert services. Manage. Sci. 54(8), 1497\u20131512 (2008)","journal-title":"Manage. Sci."},{"issue":"1","key":"9968_CR26","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1017\/S0269964813000351","volume":"28","author":"C Borgs","year":"2014","unstructured":"Borgs, C., Chayes, J.T., Doroudi, S., Harchol-Balter, M., Xu, K.: The optimal admission threshold in observable queues with state dependent pricing. Probab. Eng. Inf. Sci. 28(1), 101\u2013119 (2014)","journal-title":"Probab. Eng. Inf. Sci."},{"issue":"2","key":"9968_CR27","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1287\/msom.2021.0387","volume":"26","author":"AE Frazelle","year":"2024","unstructured":"Frazelle, A.E., Katok, E.: Paid priority in service systems: Theory and experiments. Manuf. Serv. Oper. Manage. 26(2), 775\u2013795 (2024)","journal-title":"Manuf. Serv. Oper. Manage."},{"issue":"4","key":"9968_CR28","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s11134-011-9214-5","volume":"67","author":"EB \u00c7il","year":"2011","unstructured":"\u00c7il, E.B., Karaesmen, F., \u00d6rmeci, E.L.: Dynamic pricing and scheduling in a multi-class single-server queueing system. Queueing Syst. 67(4), 305\u2013331 (2011)","journal-title":"Queueing Syst."},{"issue":"5","key":"9968_CR29","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1287\/opre.1060.0305","volume":"54","author":"C Maglaras","year":"2006","unstructured":"Maglaras, C.: Revenue management for a multiclass single-server queue via a fluid model analysis. Oper. Res. 54(5), 914\u2013932 (2006)","journal-title":"Oper. Res."},{"key":"9968_CR30","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11134-013-9382-6","volume":"77","author":"DA Stanford","year":"2014","unstructured":"Stanford, D.A., Taylor, P., Ziedins, I.: Waiting time distributions in the accumulating priority queue. Queueing Syst. 77, 297\u2013330 (2014)","journal-title":"Queueing Syst."},{"issue":"13","key":"9968_CR31","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1016\/S0140-3664(02)00005-1","volume":"25","author":"Y Jiang","year":"2002","unstructured":"Jiang, Y., Tham, C.-K., Ko, C.-C.: A probabilistic priority scheduling discipline for multi-service networks. Comput. Commun. 25(13), 1243\u20131254 (2002)","journal-title":"Comput. Commun."},{"issue":"4","key":"9968_CR32","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/S1389-1286(02)00309-2","volume":"40","author":"C-K Tham","year":"2002","unstructured":"Tham, C.-K., Yao, Q., Jiang, Y.: Achieving differentiated services through multi-class probabilistic priority scheduling. Comput. Netw. 40(4), 577\u2013593 (2002)","journal-title":"Comput. Netw."},{"issue":"1","key":"9968_CR33","doi-asserted-by":"publisher","first-page":"23","DOI":"10.3141\/1731-04","volume":"1731","author":"PG Furth","year":"2000","unstructured":"Furth, P.G., Muller, T.H.: Conditional bus priority at signalized intersections: better service with less traffic disruption. Transp. Res. Rec. 1731(1), 23\u201330 (2000)","journal-title":"Transp. Res. Rec."},{"issue":"2","key":"9968_CR34","doi-asserted-by":"publisher","first-page":"65","DOI":"10.5038\/2375-0901.2.2.4","volume":"2","author":"M Garrow","year":"1999","unstructured":"Garrow, M., Machemehl, R.: Development and evaluation of transit signal priority strategies. J. Public Transp. 2(2), 65\u201390 (1999)","journal-title":"J. Public Transp."},{"issue":"8","key":"9968_CR35","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1111\/poms.12544","volume":"25","author":"Q Ding","year":"2016","unstructured":"Ding, Q., Kouvelis, P., Milner, J.: Inventory rationing for multiple class demand under continuous review. Prod. Oper. Manag. 25(8), 1344\u20131362 (2016)","journal-title":"Prod. Oper. Manag."},{"issue":"5","key":"9968_CR36","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1057\/palgrave.jors.2600556","volume":"49","author":"I Moon","year":"1998","unstructured":"Moon, I., Kang, S.: Rationing policies for some inventory systems. J. Oper. Res. Soc. 49(5), 509\u2013518 (1998)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"9968_CR37","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1239\/jap\/1197908826","volume":"44","author":"U Ayesta","year":"2007","unstructured":"Ayesta, U.: A unifying conservation law for single-server queues. J. Appl. Probab. 44(4), 1078\u20131087 (2007)","journal-title":"J. Appl. Probab."},{"key":"9968_CR38","doi-asserted-by":"publisher","DOI":"10.3917\/droz.paret.1964.01","volume-title":"Cours D\u2019\u00e9conomie Politique","author":"V Pareto","year":"1964","unstructured":"Pareto, V.: Cours D\u2019\u00e9conomie Politique, vol. 1. Librairie Droz, Geneva (1964)"},{"issue":"1","key":"9968_CR39","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1257\/jep.29.1.29","volume":"29","author":"CI Jones","year":"2015","unstructured":"Jones, C.I.: Pareto and Piketty: the macroeconomics of top income and wealth inequality. J. Econ. Perspect. 29(1), 29\u201346 (2015)","journal-title":"J. Econ. Perspect."},{"key":"9968_CR40","unstructured":"Our Guide to Disney Lightning Lane Prices. https:\/\/www.wdw-magazine.com\/lightning-lane-multi-pass-cost\/"},{"key":"9968_CR41","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139226424","volume-title":"Performance Modeling and Design of Computer Systems: Queueing Theory in Action","author":"M Harchol-Balter","year":"2013","unstructured":"Harchol-Balter, M.: Performance Modeling and Design of Computer Systems: Queueing Theory in Action. Cambridge University Press, Cambridge (2013)"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-025-09968-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11134-025-09968-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-025-09968-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:17:06Z","timestamp":1774984626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11134-025-09968-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,19]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["9968"],"URL":"https:\/\/doi.org\/10.1007\/s11134-025-09968-9","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,19]]},"assertion":[{"value":"4 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"9"}}