Show simple item record

dc.contributor.authorLarson, Richard C., 1943-en_US
dc.date.accessioned2004-05-28T19:22:04Z
dc.date.available2004-05-28T19:22:04Z
dc.date.issued1987-08en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5071
dc.descriptionRevised May 1988en_US
dc.description.abstractThe transactional data of a queueing system are the recorded times of service commencement and service completion for each customer served. With increasing use of computers to aid or even perform service one often has machine readable transactional data, but virtually no information about the queue itself. In this paper we propose a way to deduce the queueing behavior of Poisson arrival queueing systems from only the transactional data and the Poisson assumption. For each congestion period in which queues may form, the key quantities obtained are mean wait in queue, time-dependent mean number in queue, and probability distribution of the number in queue observed by a randomly arriving customer. The methodology builds on arguments of order statistics and usually requires a computer to evaluate a recursive function. The paper concludes with a proposed procedure for estimating the extent of balking and/or reneging present in a queueing system.en_US
dc.format.extent1739132 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.publisherMassachusetts Institute of Technology, Operations Research Centeren_US
dc.relation.ispartofseriesOperations Research Center Working Paper;OR 167-87en_US
dc.titleDeducing Queue Statistics from Transactional Dataen_US
dc.typeWorking Paperen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record