Comparisons of Standard and Ticket Queues
Jamol Pender, Otis Jennings

TL;DR
This paper compares ticket and standard queues, proving they behave similarly under heavy traffic and providing heuristic estimates for ticket queue performance validated by simulation.
Contribution
It establishes heavy traffic limit theorems showing ticket and standard queues converge to the same limit, and offers heuristic performance estimates validated through simulation.
Findings
Ticket and standard queues are asymptotically indistinguishable under heavy traffic.
Heuristic estimates of ticket queue performance are accurate across various parameters.
Simulation confirms the theoretical predictions and heuristic estimates.
Abstract
Upon arrival to a ticket queue, a customer is offered a slip of paper with a number on it and is told the number of the customer currently in service. The arriving customer then chooses whether to take the slip or balk, a decision based on the perceived queue length and associated waiting time. Even after taking a ticket, a customer may abandon the queue, an event that will be unobservable until the abandoning customer would have begun service. In contrast, a standard queue has a physical waiting area so that abandonment is apparent immediately when it takes place and balking is based on the actual queue length at the time of arrival. We prove heavy tra?c limit theorems for the generalized ticket and standard queueing processes, discovering that the processes converge together to the same limit, a regulated Ornstein-Uhlenbeck (ROU) process. One conclusion is that for a highly utilized…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Queuing Theory Analysis · Bayesian Methods and Mixture Models · Random Matrices and Applications
