A Closure Approximation for the Nonstationary M/M/s Queue

Michael H. Rothkopf and Shmuel S. Oren
Additional contact information
Michael H. Rothkopf: Xerox Palo Alto Research Center
Shmuel S. Oren: Xerox Palo Alto Research Center

Management Science, 1979, vol. 25, issue 6, 522-534

Abstract: Typical queues do not have constant arrival rates. This paper discusses effective computational methods for dealing with queues having nonstationary arrival processes. It presents a computationally undemanding approximate method for finding the time dependent mean and standard deviation of the number of customers in an s server queueing system with time-varying arrival and service rates. Results are exhibited for various 1 and 3 server queues with constant service rates and sinusoidal components in the arrival rate.

Keywords: queues: nonstationary; queues: transient results; queues: numerical methods (search for similar items in EconPapers)
Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.25.6.522 (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:ormnsc:v:25:y:1979:i:6:p:522-534

Access Statistics for this article

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