QUEUING THEORY [M/M/S and M/M/S/K]
Frederick S. Hiller, Gerald J. Lieberman. Introduction to Operations Research. New York: McGraw Hill, 2005. Print.
INPUT
L: Mean entry rate follows POISSON input process
U: Mean service rate follows EXPONENTIAL distribution
S: Number of servers
K: Number of waiting places
FIRST COME FIRST SERVED ASSUMPTION
OUTPUT
A: Average number of customers in the system
B: Average number of customers in the queue
C: Average waiting time in the system
D: Average waiting time in the queue
P: Likelihood that mean entry rate will yield this N customers in the system