Optimal queue to minimize waste

DOI10.1016/J.MATHSOCSCI.2023.03.001MaRDI QIDQ6173743zbMATH OpenOpenAlexFDO

Authors Xiaochang Lei

Publication date 13 July 2023

Published in Mathematical Social Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.mathsocsci.2023.03.001

zbMATH Keywords

dynamic matchingfair queuewaste minimization

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Matching models (91B68)

Recommendations

• The curse of the first-in-first-out queue discipline
• First-fit allocation of queues: Tight probabilistic bounds on wasted space
• Influencing waiting lists
• When queueing is better than push and shove
• Fair queueing

Cites work

• Influencing waiting lists
• Optimal dynamic matching
• Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model

Cited in

(3)

• The curse of the first-in-first-out queue discipline
• Influencing waiting lists
• Stochastic rationing by waiting list

This page was built for publication: Optimal queue to minimize waste

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173743)