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

Service time distribution Exponential

Number of servers
Single
Waiting room capacity
Unlimited

M/D/1

M/G/1

M/M/s

Constant
Single
Unlimited

General
Single
Unlimited

Exponential
Multiple
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
Arrival rate (lambda)
Service rate (mu)

hour
0.11 cusomters per
0.50 cusomters per

Outputs
Direct outputs from inputs
Mean time between arrivals
Mean time per service
Traffic intensity (ro)

9.000 hour
2 hour
0.2222222222

Summary measures
Utilization rate of server
Average number of customers waiting in line (Lq)
Average number of customers in system (L)
Average time waiting in line (Wq)
Average time in system (W)
Probability of no customers in system (P0)
Distribution of number of customers in system
n (customers)
0
1
2
3
Distribution of time in queue
t (time in queue)
0.25

22.2%
0.0634920635 customers
0.2857142857 customers
0.5714285714 hour
2.5714285714 hour
77.8% (this is the probability of empty system)

P(n in system)
0.777778
0.172840
0.038409
0.008535

P(wait > t)
0.201634

Page 3

M-M-1

ime, Unlimited queue length

hour
hour

34.2857142857
154.2857142857
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
Arrival rate (lambda)
Service rate (mu)

minutes
16 customers per
20 customers per

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

0.063 minutes
0.05 minutes
0.8

Summary measures
Utilization rate of server
Average number of customers waiting in line (Lq)
Average number of customers in system (L)
Average time waiting in line (Wq)
Average time in system (W)
Probability of no customers in system (P0)

Page 5

80.0%
1.6 customers
2.4 customers
0.1 minutes
0.15 minutes
20.0%

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
Arrival rate (lambda)
Average service rate (mu)

minute
0.6 customers per
1.2 customers per

Service time standard deviation

0.3 minute

Outputs
Direct outputs from inputs
Mean time between arrivals
Mean time per service
Traffic intensity

1.667 minute
0.8333333333 minute
0.5

Summary measures
Utilization rate of server
Average number of customers waiting in line (Lq)
Average number of customers in system (L)
Average time waiting in line (Wq)
Average time in system (W)
Probability of no customers in system (P0)

Page 7

50.0%
0.406656 customers
0.906656 customers
0.67776 minute
1.5110933333 minute
50.0%

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
Arrival rate (lambda)
Service rate (mu)
Number of identical servers (s)

hour
16 customers per
20 customers per
2 servers

hour
hour

Outputs
Direct outputs from inputs
Mean time between arrivals
Mean time per service
Traffic intensity
Summary measures
Average utilization rate of server
Average number of customers waiting in line (Lq)
Average number of customers in system (L)
Average time waiting in line (Wq)
Average time in system (W)
Probability of no customers in system (P0)
Probability that all servers are busy
Probability that at least one server is idle
Distribution of number of customers in system
n (customers)
1
Distribution of time in queue
t (time in queue)
0.3333333333

0.063 hour
0.05 hour
0.4

40.0%
0.15238 customers
0.95238 customers
0.00952 hour
0.05952 hour
0.42857 (this is the probability of empty system)
22.9% (this is also the "percentage who wait in queue")
77.1% (this is also the "percentage who don't wait in queue")

P(n in system)
0.342857

P(wait > t)
0.000077

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
Arrival rate (lambda)
Service rate (mu)
Number of identical servers (s)
Buffer (waiting room) size

2.5
hour
10 customers per
4 customers per
2 servers
10 customers

hour
hour
(The maximum number in system is equal to number of servers plus waiting room size)

Outputs
Direct outputs from inputs
Mean time between arrivals
Mean time per service
Traffic intensity
Summary measures
Average utilization rate of servers
Average number of customers waiting in line (Lq)
Average number of customers in system (L)
Average time waiting in line (Wq)
Average time in system (W)
Probability of no customers in system (P0)
Probability of rejecting a customer (balking rate)
Effective arrival rate

0.100 hour
0.25 hour
1.25

98.4%
6.8534 customers
8.8204 customers
0.8710 hour
1.1210 hour
0.0073 (Probability of empty system)
21.32% (Reject rate)
7.8681503679 (Entering rate)

Model 1 (M/M/1 Queue):

Single server, finite population, Poisson arrivals, FCFS, Exponential service time, Unlimited queue length
Yellow cells need user inputed values

Inputs
Units of time
Arrival rate (lambda)
Service rate (mu)
N (jumlah input yang tersedia)

hour
0.11 cusomters per
0.50 cusomters per
3.00 yaitu mesin

n=0
n=1
n=2
n=3
po
p1
p2
p3

1.00
0.67
0.30
0.07
0.49
0.33
0.15
0.03

Lq
n=1
n=2
n=3
L

0.21
0.00
0.15
0.06
0.7181

Outputs
Direct outputs from inputs
Mean time between arrivals
Mean time per service
Traffic intensity (ro)
Summary measures
Utilization rate of server
Average number of customers waiting in line (Lq)
Average number of customers in system (L)
Average time waiting in line (Wq)
Average time in system (W)
Probability of no customers in system (P0)
Distribution of number of customers in system
n (customers)
0
1
2
3
Distribution of time in queue
t (time in queue)
0.25

9.000 hour
2 hour
0.2222222222

22.2%
0.0634920635 customers
0.2857142857 customers
0.5714285714 hour
2.5714285714 hour
77.8% (this is the probability of empty system)

P(n in system)
0.777778
0.172840
0.038409
0.008535

P(wait > t)
0.201634

e, Unlimited queue length

hour
hour
0

34.2857142857
154.2857142857
s the probability of empty system)