Waiting Line Models: Single-Server Waiting Line Model (M/M/1) Generic Template

Assumptions
#
1
2
3
4
5
6

Data Section
Symbol/Formula
λ
μ

Solution Section
Type Symbol/Formula

Probabilities P(x) = λxe-λ/x!

based on
Distributions P(service time < t) = 1 - e-μt

P0 = 1 - (λ/μ)
Lq = λ2/μ(μ - λ)
L = Lq + (λ/μ)
Operating
Wq = Lq/λ
Characteristics
W = Wq + 1/μ
Pw = λ/μ
Pn = (λ/μ)nP0
Server Waiting Line Model (M/M/1) Generic Template

Assumptions
Assumption
Arrival rates follow a Poisson probability distribution
Service times follow a negative exponential probability distribution
There is only one server (k = 1)
Waiting line discipline is first-come-first-served basis
The model depicts steady-state operations
Service rate (μ) > Arrival rate (λ)

Data Section
Description
Arrival Rate
Service Rate

Solution Section
x, t, or n Value
Description
(change as needed)
Probability of x arrivals in one time period (based on Poisson probability
0
distribution)
Probability that service time will be less than or equal to a time of length t
0
(based on negative exponential probability distribution)
Probability that no units are in the system
Average number of units in the waiting line
Average number of units in the system
Average time a unit spends in the waiting line
Average time a unit spends in the system
Probability that an arriving unit has to wait for service
Probability of n units in the system 0
 Notes:
Value Units Description Data cells
0.0000 units per time period Formula cells
0.0000 units per time period

Value Units Description

1.0000 probability

0.0000 probability

#DIV/0! probability
#DIV/0! units (e.g. customers, products, machines, etc.)
#DIV/0! units (e.g. customers, products, machines, etc.)
#DIV/0! time periods (e.g. minutes, hours, days, etc.)
#DIV/0! time periods (e.g. minutes, hours, days, etc.)
#DIV/0! probability
#DIV/0! probability
Waiting Line Models: Single-Server Waiting Line Model (M/M/1) Example - Burger Dome Restaur

Assumptions
#
1
2
3
4
5
6

Data Section
Symbol/Formula
λ
μ

Solution Section
Type Symbol/Formula

Probabilities P(x) = λxe-λ/x!

based on
Distributions P(service time < t) = 1 - e-μt

P0 = 1 - (λ/μ)
Lq = λ2/μ(μ - λ)
L = Lq + (λ/μ)
Operating
Wq = Lq/λ
Characteristics
W = Wq + 1/μ
Pw = λ/μ
Pn = (λ/μ)nP0
Server Waiting Line Model (M/M/1) Example - Burger Dome Restaurant

Assumptions
Assumption
Arrival rates follow a Poisson probability distribution
Service times follow a negative exponential probability distribution
There is only one server (k = 1)
Waiting line discipline is first-come-first-served basis
The model depicts steady-state operations
Service rate (μ) > Arrival rate (λ)

Data Section
Description
Arrival Rate
Service Rate

Solution Section
x, t, or n Value
Description
(change as needed)
Probability of x arrivals in one time period (based on Poisson probability
1
distribution)
Probability that service time will be less than or equal to a time of length t
1
(based on negative exponential probability distribution)
Probability that no units are in the system
Average number of units in the waiting line
Average number of units in the system
Average time a unit spends in the waiting line
Average time a unit spends in the system
Probability that an arriving unit has to wait for service
Probability of n units in the system 1
 Notes:
Value Units Description Data cells
0.7500 customers per minute Formula cells
1.0000 customers per minute

Value Units Description

0.3543 probability

0.6321 probability

0.2500 probability
2.2500 customers
3.0000 customers
3.0000 minutes
4.0000 minutes
0.7500 probability
0.1875 probability
Waiting Line Models: Single-Server Waiting Line Model (M/M/1) Exercises 1-3 - Willow Brook Nati

Assumptions
#
1
2
3
4
5
6

Data Section
Symbol/Formula
λ
μ

Solution Section
Type Symbol/Formula

Probabilities P(x) = λxe-λ/x!

based on
Distributions P(service time < t) = 1 - e-μt

P0 = 1 - (λ/μ)
Lq = λ2/μ(μ - λ)
L = Lq + (λ/μ)
Operating
Wq = Lq/λ
Characteristics
W = Wq + 1/μ
Pw = λ/μ
Pn = (λ/μ)nP0
Server Waiting Line Model (M/M/1) Exercises 1-3 - Willow Brook National Bank

Assumptions
Assumption
Arrival rates follow a Poisson probability distribution
Service times follow a negative exponential probability distribution
There is only one server (k = 1)
Waiting line discipline is first-come-first-served basis
The model depicts steady-state operations
Service rate (μ) > Arrival rate (λ)

Data Section
Description
Arrival Rate
Service Rate

Solution Section
x, t, or n Value
Description
(change as needed)
Probability of x arrivals in one time period (based on Poisson probability
3
distribution)
Probability that service time will be less than or equal to a time of length t
2
(based on negative exponential probability distribution)
Probability that no units are in the system
Average number of units in the waiting line
Average number of units in the system
Average time a unit spends in the waiting line
Average time a unit spends in the system
Probability that an arriving unit has to wait for service
Probability of n units in the system 1
 Notes:
Value Units Description
0.4000 customers per minute
0.6000 customers per minute

Value Units Description

0.0072 probability

0.6988 probability

0.3333 probability
1.3333 customers
2.0000 customers
3.3333 minutes
5.0000 minutes
0.6667 probability
0.2222 probability
Data cells
Formula cells
Waiting Line Models: Multiple-Server Waiting Line Model (M/M/k, Single Line) Generic Template

Assumptions
#
1
2
3
4
5
6

Data Section
Symbol/Formula
λ
μ
k
λ/μ ratio

Solution Section
Type Symbol/Formula

Probabilities P(x) = λxe-λ/x!

based on
Distributions P(service time < t) = 1 - e-μt

0
0
Lq = [(λ/μ)kλμ/(k - 1)!(kμ - λ)2]P0
L = Lq + (λ/μ)
Operating Wq = Lq/λ
Characteristics
W = Wq + 1/μ
Pw = ((1/k!)(λ/μ)k(kμ/kμ - λ))P0
Pn = ((λ/μ)n/n!)P0
Pn = ((λ/μ)n/k!k(n-k))P0
ver Waiting Line Model (M/M/k, Single Line) Generic Template

Assumptions
Assumption
Arrival rates follow a Poisson probability distribution
Service times follow a negative exponential probability distribution
There is only one server (k = 1)
Waiting line discipline is first-come-first-served basis
The model depicts steady-state operations
A single shared waiting line is used for all servers

Data Section
Description
Arrival Rate
Service Rate
Number of Servers
Ratio of arrival rate/service rate (for table reference)

Solution Section
x, t, or n Value
Description
(change as needed)
Probability of x arrivals in one time period (based on Poisson probability
0
distribution)
Probability that service time will be less than or equal to a time of length t
0
(based on negative exponential probability distribution)

Probability that no units are in the system

Average number of units in the waiting line

Average number of units in the system
Average time a unit spends in the waiting line
Average time a unit spends in the system
Probability that an arriving unit has to wait for service
Probability of n units in the system (for n < k) 0
Probability of n units in the system (for n > k) 0
 Notes:
Value Units Description Data cells
0.00 units per time period Formula cells
0.00 units per time period
0.00 servers
#DIV/0! servers

Value Units Description

1.00 probability

#DIV/0! probability

Ref. Table 15.4 probability

#DIV/0! units (e.g. customers, products, machines, etc.)

#DIV/0! units (e.g. customers, products, machines, etc.)
#DIV/0! time periods (e.g. minutes, hours, days, etc.)
#DIV/0! time periods (e.g. minutes, hours, days, etc.)
#DIV/0! probability
#DIV/0! probability
#DIV/0! probability
Waiting Line Models: Multiple-Server Waiting Line Model (M/M/k, Single Line) Example - Burger

Assumptions
#
1
2
3
4
5
6

Data Section
Symbol/Formula
λ
μ
k
λ/μ ratio

Solution Section
Type Symbol/Formula

Probabilities P(x) = λxe-λ/x!

based on
Distributions P(service time < t) = 1 - e-μt

0
0
Lq = [(λ/μ)kλμ/(k - 1)!(kμ - λ)2]P0
L = Lq + (λ/μ)
Operating Wq = Lq/λ
Characteristics
W = Wq + 1/μ
Pw = ((1/k!)(λ/μ)k(kμ/kμ - λ))P0
Pn = ((λ/μ)n/n!)P0
Pn = ((λ/μ)n/k!k(n-k))P0
ver Waiting Line Model (M/M/k, Single Line) Example - Burger Dome Restaurant (k=2)

Assumptions
Assumption
Arrival rates follow a Poisson probability distribution
Service times follow a negative exponential probability distribution
There is only one server (k = 1)
Waiting line discipline is first-come-first-served basis
The model depicts steady-state operations
A single shared waiting line is used for all servers

Data Section
Description
Arrival Rate
Service Rate
Number of Servers
Ratio of arrival rate/service rate (for table reference)

Solution Section
x, t, or n Value
Description
(change as needed)
Probability of x arrivals in one time period (based on Poisson probability
1
distribution)
Probability that service time will be less than or equal to a time of length t
1
(based on negative exponential probability distribution)

Probability that no units are in the system

Average number of units in the waiting line

Average number of units in the system
Average time a unit spends in the waiting line
Average time a unit spends in the system
Probability that an arriving unit has to wait for service
Probability of n units in the system (for n < k) 2
Probability of n units in the system (for n > k) 3
rant (k=2)

Notes:
Value Units Description Data cells
0.75 customers per minute Formula cells
1.00 customers per minute
2.00 servers
0.75 servers

Value Units Description

0.35 probability

0.53 probability

0.4545 probability

0.1227 customers
0.8727 customers
0.1636 minutes
1.1636 minutes
0.2045 probability
0.1278 probability
0.0479 probability
Waiting Line Models: Multiple-Server Waiting Line Model (M/M/k, Single Line) Exercise 4 - Pete's

Assumptions
#
1
2
3
4
5
6

Data Section
Symbol/Formula
λ
μ
k
λ/μ ratio

Solution Section
Type Symbol/Formula

Probabilities P(x) = λxe-λ/x!

based on
Distributions P(service time < t) = 1 - e-μt

0
0
Lq = [(λ/μ)kλμ/(k - 1)!(kμ - λ)2]P0
L = Lq + (λ/μ)
Operating Wq = Lq/λ
Characteristics
W = Wq + 1/μ
Pw = ((1/k!)(λ/μ)k(kμ/kμ - λ))P0
Pn = ((λ/μ)n/n!)P0
Pn = ((λ/μ)n/k!k(n-k))P0
ver Waiting Line Model (M/M/k, Single Line) Exercise 4 - Pete's Market (k=2)

Assumptions
Assumption
Arrival rates follow a Poisson probability distribution
Service times follow a negative exponential probability distribution
There is only one server (k = 1)
Waiting line discipline is first-come-first-served basis
The model depicts steady-state operations
A single shared waiting line is used for all servers

Data Section
Description
Arrival Rate
Service Rate
Number of Servers
Ratio of arrival rate/service rate (for table reference)

Solution Section
x, t, or n Value
Description
(change as needed)
Probability of x arrivals in one time period (based on Poisson probability
1
distribution)
Probability that service time will be less than or equal to a time of length t
1
(based on negative exponential probability distribution)

Probability that no units are in the system

Average number of units in the waiting line

Average number of units in the system
Average time a unit spends in the waiting line
Average time a unit spends in the system
Probability that an arriving unit has to wait for service
Probability of n units in the system (for n < k) 2
Probability of n units in the system (for n > k) 3
 Notes:
Value Units Description Data cells
0.25 customers per minute Formula cells
0.50 customers per minute
2.00 servers
0.50 servers

Value Units Description

0.19 probability

0.39 probability

0.6000 probability

0.0333 customers
0.5333 customers
0.1333 minutes
2.1333 minutes
0.1000 probability
0.0750 probability
0.0188 probability
Waiting Line Models: Single-Server Waiting Line Model with Poisson Arrivals and Arbitrary Servic

Assumptions
#
1
2
3
4
5
6

Data Section
Symbol/Formula
λ
μ
σ

Solution Section
Type Symbol/Formula

Probabilities P(x) = λxe-λ/x!

based on
Distributions P(service time < t) = 1 - e-μt

P0 = 1 - (λ/μ)
Lq = (λ2σ2 + (λ/μ)2)/2(1- λ/μ)
Operating L = Lq + (λ/μ)
Characteristics Wq = Lq/λ
W = Wq + 1/μ
Pw = λ/μ
Server Waiting Line Model with Poisson Arrivals and Arbitrary Service Times (M/G/1) Generic Template

Assumptions
Assumption
Arrival rates follow a Poisson probability distribution
Service times follow a general or unspecified probability distribution
There is only one server (k = 1)
Waiting line discipline is first-come-first-served basis
The model depicts steady-state operations
Service rate (μ) > Arrival rate (λ)

Data Section
Description
Arrival Rate
Service Rate
Standard Deviation of Service Rate

Solution Section
Description x, t, or n Value
(change as needed)
Probability of x arrivals in one time period (based on Poisson probability
0
distribution)
Probability that service time will be less than or equal to a time of length t
0
(based on negative exponential probability distribution)
Probability that no units are in the system
Average number of units in the waiting line
Average number of units in the system
Average time a unit spends in the waiting line
Average time a unit spends in the system
Probability that an arriving unit has to wait for service
M/G/1) Generic Template

Notes:
Value Units Description Data cells
0.0000 units per time period Formula cells
0.0000 units per time period
0.0000 time periods

Value Units Description

1.0000 probability

0.0000 probability

#DIV/0! probability
#DIV/0! units (e.g. customers, products, machines, etc.)
#DIV/0! units (e.g. customers, products, machines, etc.)
#DIV/0! time periods (e.g. minutes, hours, days, etc.)
#DIV/0! time periods (e.g. minutes, hours, days, etc.)
#DIV/0! probability
Waiting Line Models: Single-Server Waiting Line Model with Poisson Arrivals and Arbitrary Servic

Assumptions
#
1
2
3
4
5
6

Data Section
Symbol/Formula
λ
μ
σ

Solution Section
Type Symbol/Formula

Probabilities P(x) = λxe-λ/x!

based on
Distributions P(service time < t) = 1 - e-μt

P0 = 1 - (λ/μ)
Lq = (λ2σ2 + (λ/μ)2)/2(1- λ/μ)
Operating L = Lq + (λ/μ)
Characteristics Wq = Lq/λ
W = Wq + 1/μ
Pw = λ/μ
Server Waiting Line Model with Poisson Arrivals and Arbitrary Service Times (M/G/1) Example - Hartlage's

Assumptions
Assumption
Arrival rates follow a Poisson probability distribution
Service times follow a general or unspecified probability distribution
There is only one server (k = 1)
Waiting line discipline is first-come-first-served basis
The model depicts steady-state operations
Service rate (μ) > Arrival rate (λ)

Data Section
Description
Arrival Rate
Service Rate
Standard Deviation of Service Rate

Solution Section
Description x, t, or n Value
(change as needed)
Probability of x arrivals in one time period (based on Poisson probability
0
distribution)
Probability that service time will be less than or equal to a time of length t
0
(based on negative exponential probability distribution)
Probability that no units are in the system
Average number of units in the waiting line
Average number of units in the system
Average time a unit spends in the waiting line
Average time a unit spends in the system
Probability that an arriving unit has to wait for service
M/G/1) Example - Hartlage's Seafood Supply

Notes:
Value Units Description Data cells
0.3500 customers per minute Formula cells
0.5000 customers per minute
1.2000 minutes

Value Units Description

0.7047 probability

0.0000 probability

0.3000 probability
1.1107 customers
1.8107 customers
3.1733 minutes
5.1733 minutes
0.7000 probability
Waiting Line Models: Single-Server Waiting Line Model with Poisson Arrivals and Arbitrary Servic

Assumptions
#
1
2
3
4
5
6

Data Section
Symbol/Formula
λ
μ
σ

Solution Section
Type Symbol/Formula

Probabilities P(x) = λxe-λ/x!

based on
Distributions P(service time < t) = 1 - e-μt

P0 = 1 - (λ/μ)
Lq = (λ2σ2 + (λ/μ)2)/2(1- λ/μ)
Operating L = Lq + (λ/μ)
Characteristics Wq = Lq/λ
W = Wq + 1/μ
Pw = λ/μ
Server Waiting Line Model with Poisson Arrivals and Arbitrary Service Times (M/G/1) Exercise 5 - Gubser W

Assumptions
Assumption
Arrival rates follow a Poisson probability distribution
Service times follow a general or unspecified probability distribution
There is only one server (k = 1)
Waiting line discipline is first-come-first-served basis
The model depicts steady-state operations
Service rate (μ) > Arrival rate (λ)

Data Section
Description
Arrival Rate
Service Rate
Standard Deviation of Service Rate

Solution Section
Description x, t, or n Value
(change as needed)
Probability of x arrivals in one time period (based on Poisson probability
1
distribution)
Probability that service time will be less than or equal to a time of length t
1
(based on negative exponential probability distribution)
Probability that no units are in the system
Average number of units in the waiting line
Average number of units in the system
Average time a unit spends in the waiting line
Average time a unit spends in the system
Probability that an arriving unit has to wait for service
M/G/1) Exercise 5 - Gubser Welding, Inc.

Notes:
Value Units Description Data cells
0.2500 jobs per hour Formula cells
0.3125 jobs per hour
2.0000 hours

Value Units Description

0.1947 probability

0.2684 probability

0.2000 probability
2.2250 jobs
3.0250 jobs
8.9000 hours
12.1000 hours
0.8000 probability