Queue inference from periodic reporting data

Authors:
Jesse C. Frey;Edward H. Kaplan
Affiliations:
Department of Mathematical Sciences, Villanova University, 800 Lancaster Avenue, Villanova, PA 19085, United States;Yale School of Management, 135 Prospect Street, New Haven, CT 06511, United States and Yale School of Public Health, New Haven, CT 06511, United States and Yale School of Engineering and Applied S ...
Venue:
Operations Research Letters
Year:
2010

Citing 4
Cited 1

The queue inference engine: deducing queue statistics from transactional data

Management Science
Deducing queueing from transactional data: the queue inference engine, revisited

Operations Research - Supplement to Operations Research: stochastic processes
Estimating characteristics of queueing networks using transactional data

Queueing Systems: Theory and Applications
Terror Queues

Operations Research

OR Forum---Intelligence Operations Research: The 2010 Philip McCord Morse Lecture

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce new algorithms for queue inference problems involving periodic reporting data. We assume that in each of several consecutive time periods, new customer arrivals follow a Poisson process with period-specific arrival rates, but only the number of departing customers during each period is observed. Rather than exploiting relations with order statistics, our algorithms rely on direct recursions involving Poisson probabilities. We illustrate with several examples, some of which are not typically viewed as queueing applications.