WAITING LINE
The service time for each server
▪ λ = the mean number of arrivals per time
period (the arrival rate)
▪ μ = the mean number of services per time
period (the service rate)
▪ k = the number of servers
▪ Po = probability there are customers
▪ Lq = Average number of customers / units
in the waiting line
▪ L = Average number of customers / units in
the system
▪ Wq = Average time a customer / units will
spend waiting line
▪ W = Average time a customer / units will
spend in the system
▪ Pw = Probability that an arriving customer
would wait for service?
▪ Pn = Probability that there are n in the
system
▪ Multiple-server waiting line consists of
two or more servers that are assumed to be
identical in terms of service capability
▪ two typical queueing possibilities
a) arriving customers wait in a single waiting
line (called a “pooled” or “shared” queue)
and then move to the first available server
for processing, or
b) each server has a “dedicated” queue and
an arriving customer selects one of these
lines to join (and typically is not allowed to
switch lines).
▪ Steady-state Operating
Characteristics
1. The arrivals follow a Poisson
probability distribution
Roxy ♡
2.
follows an exponential probability
distribution
3. The service rate m is the same for
each server
4. The arrivals wait in a single waiting
line and then move to the first
open server for service
SIMULATION
▪ Interarrival time = a + r(b-a) where:
• r = random number between 0 and 1
• a = minimum arrival time
• b = maximum arrival time
▪ Arrival time (AT) = current IAT + previous
AT
▪ Service Start Time (SST) = arrival time (AT)
or completion time (CT), whichever is higher
▪ Completion time (CT) = service start time
(SST) + service time (ST)
▪ Waiting time (WT) = service start time (SST)
– arrival time (AT)
▪ Time in system (TS) = completion time (CT)
– arrival time (AT)
▪ Time in system (TS) = waiting time (WT) +
service time (ST)
▪ Server Utilization Rate = Total ST / (Max
CT - Min CT)
▪ End of Simulation = last customer’s
completion time