models

How to choose a queueing model

All models in this workbook are Poisson arrivals, infinite population, and FCFS.
The models differ by
(1) the service time distribution (exponential, constant or general)
(2) the number of servers (single server or multiple servers)
(3) waiting room capacity (unlimited waiting room or limited waiting room buffer)

M/M/1 M/D/1 M/G/1 M/M/s

Service time distribution Exponential Constant General Exponential
Number of servers Single Single Single Multiple
Waiting room capacity Unlimited Unlimited Unlimited Unlimited

The Erlang Loss Model is a special case of M/M/s/b model where the waiting room capacity (b) is zero.

The following models assume exponential distribution of service time:

M/M/1, M/M/s, M/M/s/b
The following models assume constant service time:
M/C/1
The following models assume generally distributed (such as normal) service time:
M/G/1

The following models assume a single server:

M/M/1, M/C/1, M/G/1
The following models assume multiple servers:
M/M/s, M/M/s/b

The following models assume unlimited waiting room capacity:

M/M/1, M/C/1, M/G/1, M/M/s
The following models assume limited waiting room capacity:
M/M/s/b

Page 1
 models

M/M/s/b
Exponential
Multiple
Limited

Page 2
 M-M-1

Model 1 (M/M/1 Queue):

Single server, Infinite population, Poisson arrivals, FCFS, Exponential service time, Unlimited queue length
Yellow cells need user inputed values
Inputs
Units of time hour
Arrival rate (lambda) 8 cusomters per
Service rate (mu) 10 cusomters per

Outputs
Direct outputs from inputs
Mean time between arrivals 0.125 hour
Mean time per service 0.1 hour
Traffic intensity 0.8

Summary measures
Utilization rate of server 80.0%
Average number of customers waiting in line (Lq) 3.2 customers
Average number of customers in system (L) 4 customers
Average time waiting in line (Wq) 0.4 hour
Average time in system (W) 0.5 hour
Probability of no customers in system (P0) 20.0% (this is the probability of empty system)

Distribution of number of customers in system

n (customers) P(n in system)
0 0.200000

Distribution of time in queue

t (time in queue) P(wait > t)
0.25 0.485225

Page 3
 M-M-1

time, Unlimited queue length

hour
hour

24
30
is the probability of empty system)

Page 4
 M-D-1

Model 2 (M/C/1 Queue):

Single server, Infinite Population, Poisson Arrival, FCFS, Constant Service Time, Unlimited Queue Length
Yellow cells need user inputed values
Inputs
unit of time minutes
Arrival rate (lambda) 16 customers per
Service rate (mu) 20 customers per

Outputs
Direct outputs from inputs
Mean time between arrivals 0.063 minutes
Exact time per service (no variability) 0.05 minutes
Traffic intensity 0.8

Summary measures
Utilization rate of server 80.0%
Average number of customers waiting in line (Lq) 1.6 customers
Average number of customers in system (L) 2.4 customers
Average time waiting in line (Wq) 0.1 minutes
Average time in system (W) 0.15 minutes
Probability of no customers in system (P0) 20.0%

Page 5
 M-D-1

me, Unlimited Queue Length

minutes
minutes

6
9

Page 6
 M-G-1

Model 3 (M/G/1 Queue):

Single server, Infinite Population, Poisson Arrival, FCFS, General Service Time, Unlimited Queue Length
Yellow cells need user inputed values
Inputs
Unit of time minute
Arrival rate (lambda) 0.6 customers per
Average service rate (mu) 1.2 customers per
Service time standard deviation 0.3 minute

Outputs
Direct outputs from inputs
Mean time between arrivals 1.667 minute
Mean time per service 0.8333333333 minute
Traffic intensity 0.5

Summary measures
Utilization rate of server 50.0%
Average number of customers waiting in line (Lq) 0.406656 customers
Average number of customers in system (L) 0.906656 customers
Average time waiting in line (Wq) 0.67776 minute
Average time in system (W) 1.5110933333 minute
Probability of no customers in system (P0) 50.0%

Page 7
 M-G-1

e, Unlimited Queue Length

minute
minute

Page 8
Model 4: Multiple servers with infinite waiting room

Model 4 (M/M/s Queue):

Multiple servers, Infinite population, Poisson arrival, FCFS, Exponential service time, Unlimited waiting room
Yellow cells need user inputed values
Inputs
Unit of time hour
Arrival rate (lambda) 16 customers per hour
Service rate (mu) 20 customers per hour
Number of identical servers (s) 2 servers

Outputs
Direct outputs from inputs
Mean time between arrivals 0.063 hour
Mean time per service 0.05 hour
Traffic intensity 0.4

Summary measures
Average utilization rate of server 40.0%
Average number of customers waiting in line (Lq) #VALUE! customers
Average number of customers in system (L) #VALUE! customers
Average time waiting in line (Wq) #VALUE! hour
Average time in system (W) #VALUE! hour
Probability of no customers in system (P0) #VALUE! (this is the probability of empty system)
Probability that all servers are busy #VALUE! (this is also the "percentage who wait in queue")
Probability that at least one server is idle #VALUE! (this is also the "percentage who don't wait in queue")

Distribution of number of customers in system

n (customers) P(n in system)
1 #VALUE!

Distribution of time in queue

t (time in queue) P(wait > t)
0.3333333333 #VALUE!
Model 5: Multiple servers with finite buffers

Model 5 (M/M/s/b queue):

Multiple servers, Infinite population, Poisson arrival, FCFS, Exponential service time, Limited buffer (b)
Yellow cells need user inputed values
Inputs
Unit of time hour
Arrival rate (lambda) 10 customers per hour
Service rate (mu) 4 customers per hour
Number of identical servers (s) 4 servers
Buffer (waiting room) size 50 customers (The maximum number in system is equal to number of servers plus waiting room size)

Outputs
Direct outputs from inputs
Mean time between arrivals 0.100 hour
Mean time per service 0.25 hour
Traffic intensity 0.625

Summary measures
Average utilization rate of servers #VALUE!
Average number of customers waiting in line (Lq) #VALUE! customers
Average number of customers in system (L) #VALUE! customers
Average time waiting in line (Wq) #VALUE! hour
Average time in system (W) #VALUE! hour
Probability of no customers in system (P0) #VALUE! (Probability of empty system)
Probability of rejecting a customer (balking rate) #VALUE! (Reject rate)
Effective arrival rate #VALUE! (Entering rate)