Exploiting Partial Information in Queueing Systems

Yasushi Masuda
Additional contact information
Yasushi Masuda: University of California, Riverside, California

Operations Research, 1995, vol. 43, issue 3, 530-536

Abstract: We often try to draw inferences from partial observations of queueing systems in real-life situations. For example, if we observe many customer arrivals, we may presume that the system is crowded and many customers are served. Unfortunately, such an intuitive statement is not necessarily valid. We provide sufficient conditions under which the intuition can be justified, and investigate related properties of queueing systems. We also study a way to exploit the partial information in a quantitative manner for simple queueing systems. One numerical result is rather counterintuitive. Specifically, the number of customers in the system at time t given that the cumulative number of departures is a certain constant is not necessarily stochastically increasing in t for a simple M / M /1 system with finite capacity.

Keywords: queues; inference; transient results (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.43.3.530 (application/pdf)

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:inm:oropre:v:43:y:1995:i:3:p:530-536

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().