A Closure Approximation for the Nonstationary M/M/s Queue
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.
Year of publication: |
1979
|
---|---|
Authors: | Rothkopf, Michael H. ; Oren, Shmuel S. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 25.1979, 6, p. 522-534
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | queues: nonstationary | queues: transient results | queues: numerical methods |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Saboo, S., (1989)
- More ...
Similar items by person
-
A closure approximation for the nonstationary M/M/s queue
Rothkopf, Michael H., (1979)
-
Optimal bidding in sequential auctions
Oren, Shmuel S., (1975)
-
A Market Dynamics Model for New Industrial Products and Its Application
Oren, Shmuel S., (1984)
- More ...