Deducing Queueing From Transactional Data: The Queue Inference Engine, Revisited
Name
OR-212-90.pdf
Size
918.51 KB
Format
Adobe PDF
Checksum (MD5)
a2623b48a0fee66eff0f6f48308fbcea
Author(s)
Bertsimas, Dimitris J.
Servi, Les D.
Date Issued
April 1990
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 212-90
Abstract
Larson [1] proposed a method to statistically infer the expected transient queue length during a busy period in 0(n 5 ) solely from the n starting and stopping times of each customer's service during the busy period and assuming the arrival distribution is Poisson. We develop a new O(n3 ) algorithm which uses this data to deduce transient queue lengths as well as the waiting times of each customer in the busy period. We also develop an O(n) on line algorithm to dynamically update the current estimates for queue lengths after each departure. Moreover we generalize our algorithms for the case of time-varying Poisson process and also for the case of iid interarrival times with an arbitrary distribution. We report computational results that exhibit the speed and accuracy of our algorithms.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
