A Closure Approximation for the Nonstationary <i>M</i>/<i>M</i>/<i>s</i> 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.

• 저널Management Science · 25(6) · 522–534
• 토픽Advanced Queuing Theory Analysis · Management Information Systems
• DOI10.1287/mnsc.25.6.522
• 저자Michael H. Rothkopf, Shmuel S. Oren