Approximating the Behavior of Nonstationary Single-Server Queues

S. C. Moore
Additional contact information
S. C. Moore: University of Missouri, Columbia, Missouri

Operations Research, 1975, vol. 23, issue 5, 1011-1032

Abstract: This paper presents computationally efficient techniques for approximating several behavioral aspects of the M x ( t )/ E Y /1 queue. The nonstationary arrival stream allows demands for service to follow different distributions over different time intervals. Specific performance characteristics evaluated are the first two moments of queue length, virtual waiting time, and system utilization. These are based on approximating the distribution of Q ( t ) at the time points E [ T n ] by the distribution of Q n , where T n is the epoch of the n th departure and Q n = Q ( T n + 0). The results are in agreement with those obtained by simulation but require much less computing time. Sample results are presented for both stationary and nonstationary examples.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.5.1011 (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:23:y:1975:i:5:p:1011-1032

Access Statistics for this article

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