Comparisons of ticket and standard queues

Otis B. Jennings () and Jamol Pender ()
Additional contact information
Jamol Pender: Cornell University

Queueing Systems: Theory and Applications, 2016, vol. 84, issue 1, No 6, 145-202

Abstract: Abstract Upon arrival to a ticket queue, a customer is offered a slip of paper with a number on it—indicating the order of arrival to the system—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 traffic limit theorems for the generalized ticket and standard queueing processes, discovering that the processes converge together to the same limit, a regulated Ornstein–Uhlenbeck process. One conclusion is that for a highly utilized service system with a relatively patient customer population, the ticket and standard queue performances are asymptotically indistinguishable on the scale typically uncovered under heavy traffic approaches. Next, we heuristically estimate several performance metrics of the ticket queue, some of which are of a sensitivity typically undetectable under diffusion scaling. The estimates are tested using simulation and are shown to be quite accurate under a general collection of parameter settings.

Keywords: Ticket Queues; Unobservable Queues; Abandonment; Heavy Traffic; Limit Theorems; Diffusion Approximations; 60K25; 90B22; 68M20; 60F17 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://link.springer.com/10.1007/s11134-016-9493-y 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:84:y:2016:i:1:d:10.1007_s11134-016-9493-y

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

DOI: 10.1007/s11134-016-9493-y

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 ().