A B C D E F G

1 Problem Title
2 Queuing Model M/M/s (Exponential Service Times)
3
4 1. Both l and m must be rates rather than times, and must use the same time unit. For example, given a
5 service time such as 10 minutes per customer, it must be converted to a service rate such (i.e. 6 per hour).
6 2. The total service rate (rate multiplied by number of servers) must be greater than the arrival rate.
7
8 Input Data Outputs
9 Arrival rate (l) Average server utilization (r) #DIV/0!
10 Service rate (m) Average number of customers in the queue (Lq) #N/A
11 Number of servers (s) Average number of customers in the system (L) #DIV/0!
12 Average waiting time in the queue (Wq) #N/A
13 Average time in the system (W) #DIV/0!
14 Probability (% of time) system is empty (P0) #N/A
15
16 ERROR. The service rate must be greater than the arrival rate.
17

18 Probabilities of
number in system
19 Cumulative
Number of Units Probability Probability
20 0 0.0000 0.0000
21 1 #DIV/0! #DIV/0!
22 2 #DIV/0! #DIV/0!
23 3 #DIV/0! #DIV/0!
24 4 #DIV/0! #DIV/0!
25 5 #DIV/0! #DIV/0!
26 6 #DIV/0! #DIV/0!
27 7 #DIV/0! #DIV/0!
28 8 #DIV/0! #DIV/0!
29 9 #DIV/0! #DIV/0!
30 10 #DIV/0! #DIV/0!
31 11 #DIV/0! #DIV/0!
 A B C D E F G
32 12 #DIV/0! #DIV/0!
33 13 #DIV/0! #DIV/0!
34 14 #DIV/0! #DIV/0!
35 15 #DIV/0! #DIV/0!
36 16 #DIV/0! #DIV/0!
37 17 #DIV/0! #DIV/0!
38 18 #DIV/0! #DIV/0!
39 19 #DIV/0! #DIV/0!
40 20 #DIV/0! #DIV/0!
41
 H I J
32
33
34
35
36
37
38
39
40
41
Problem Title
Queuing Model M/D/1 (Constant Service Times)

1. Both l and m must be RATES,

rates rather
and than times,
use the andtime
same must use
unit. the
For same time
example, unit.
given For example,
a service time
such as
given a service
10 minutes
time per
suchcustomer,
as 10 minutes
convertper
it to
customer,
a serviceit rate
mustsuch
be converted
as 6 per hour.
to a service rate such (i.e.
2.per
6 Thehour).
service rate must be greater than the arrival rate.
.

Input Data Outputs

Arrival rate (l) Average server utilization (r) #DIV/0!
Service rate (m) Average number of customers in the queue (Lq) #DIV/0!
Average number of customers in the system (L) #DIV/0!
Average waiting time in the queue (Wq) #DIV/0!
Average time in the system (W) #DIV/0!
Probability (% of time) system is empty (P0) #DIV/0!

ERROR. The service rate must be greater than the arrival rate.
 example,
ate such (i.e.
Problem Title
Queuing Model M/G/1 (General Service Times)

1. Both l and m must be RATES,

rates rather
and than
use the
times,
sameandtime
mustunit.
useHowever,
the samethetime
standard
unit. deviation
For example,
(s) must
given a
be for the
service time
service
such TIME,
as 10 minutes
not the service
per customer,
rate. it must be converted to a service rate such (i.e. 6 per hour).
2. The
Standard
service
deviation
rate must
must
be be
greater
in units
than
of the
timearrival
(hours,rate.
minutes etc)
.
Input Data Outputs
Arrival rate (l) 0 Average server utilization (r) #DIV/0!
Service rate (m) 0 Average number of customers in the queue (Lq) #DIV/0!
Standard deviation (s) 0.0000 Average number of customers in the system (L) #DIV/0!
Average waiting time in the queue (Wq) #DIV/0!
Average time in the system (W) #DIV/0!
Probability (% of time) system is empty (P0) #DIV/0!

ERROR. The service rate must be greater than the arrival rate.
 ple, given a
6 per hour).
Problem Title
Queuing Model M/M/s with a finite population

1. Both l and m must be RATES,

rates (rather
and use
thanthe
times),
sameand
timemust
unit. use the same time unit.
2. The arrival rate is for
for each
eachmember
memberofofthethepopulation.
population.
ForFor example,
example, if each
if each member
member of the
of the
population goes for service on average
once once
every 20 every 20
minutes, minutes,
then enter lthen enterhour)
= 3 (per l = .3 (per hour).

Input Data Outputs

Arrival rate per
customer (l) Average server utilization (r)
Service rate (m) Average number of customers in the queue (Lq)
Number of servers (s) Average number of customers in the system (L)
Population size (N) Average waiting time in the queue (Wq)
Average time in the system (W)
Probability (% of time) system is empty (P0)
Effective arrival rate

Probabilities of
number in system
Cumulative
Number of Units Probability Probability Number waiting
0 #DIV/0! #DIV/0! 0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
of
hethe
.

#DIV/0!
#DIV/0!
#DIV/0!
#DIV/0!
#DIV/0!
#DIV/0!
#DIV/0!

#DIV/0!
Arrival Sum term Sum term Decum
rate(n) Term 1 1 Term 2 2 term 2 P0(s)
0 #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0! #DIV/0!