Home Chapter 9: Queuing Models Key Equations

Key Equations

(9-1)

Where:
X = number of arrivals per unit of time (e.g., hour)
P(X) = probability of exactly X arrivals
λ = average arrival rate (i.e., average number of arrivals per unit of time)
e = 2.7183 (known as the exponential constant)

• Poisson probability distribution used in describing arrivals.

(9-2) P (t) = e-μt for t ≥ 0

Where:
t = service time
P(t) = probability that service time will be greater than t
μ = average service rate (i.e., average number of customers served per unit of time)
e = 2.7183 (exponential constant)

• Exponential probability distribution used in describing service times.

Equations 9-3 through 9-9 describe the operating characteristics in a single-server queuing system that has Poisson arrivals
and exponential service times.

λ = average number of arrivals per time period (e.g., per hour)

μ = average number of people or items served per time period

(9-3) ρ = λ / μ

• Average server utilization in the system.

(9-4)

• Average number of customers or units waiting in line for service.

(9-5) L = L q + λ / μ

• Average number of customers or units in the system.

(9-6)

• Average time a customer or unit spends waiting in line for service.

(9-7) W = Wq + 1/ μ

• Average time a customer or unit spends in the system.

(9-8) P0 = 1 – λ / μ

• Probability that there are zero customers or units in the system.

(9-9) Pn = (λ / μ) n P0

• Probability that there are n customers or units in the system.

(9-10) Total cost = Cw × L + Cs × s

Where:
Cw = customer waiting cost per unit time period
L = average number of customers in the system
Cs = cost of providing service per server per unit time period
s = Number of servers in the queuing system

• Total cost is the sum of waiting cost and service cost.

Equations 9-11 through 9-18 describe the operating characteristics in a multiple-server queuing system that has Poisson
arrivals and exponential service times.
(9-11) ρ = λ/(sμ)

• Average server utilization in the system.

(9-12)

• Probability that there are zero customers or units in the system.

(9-13)

• Average number of customers or units waiting in line for service.

(9-14) L = L q + λ / μ

• The average number of customers or units in the system.

(9-15) Wq = L q / λ

• Average time a customer or unit spends waiting in line for service.

(9-16) W = Wq + 1/ μ

• Average time a customer or unit spends in the system.

(9-17)

• Probability that there are n customers or units in the system, for n≤s.

(9-18)

• Probability that there are n customers or units in the system, for n>s.

Equations 9-19 through 9-24 describe the operating characteristics in a single-server queuing system that has Poisson arrivals
and constant service times.

λ = average number of arrivals per time period (e.g., per hour)

μ = average number of people or items served per time period

(9-19) ρ = λ / μ

• Average server utilization in the system.

(9-20)

• Average number of customers or units waiting in line for service.

(9-21) L = L q + λ / μ

• Average number of customers or units in the system.

(9-22)

• Average time a customer or unit spends waiting in line for service.

(9-23) W = Wq + 1/ μ

• Average time a customer or unit spends in the system.

(9-24) P0 = 1 – λ/ μ

• Probability that there are zero customers or units in the system.

Equations 9-25 through 9-30 describe the operating characteristics in a single-server queuing system that has Poisson arrivals
and general service times.

λ = average number of arrivals per time period (e.g., per hour)

μ = average number of people or items served per time period
σ = standard deviation of service time

(9-25) ρ = λ / μ

• Average server utilization in the system.

(9-26)

• Average number of customers or units waiting in line for service.

(9-27) L = L q + λ / μ

• Average number of customers or units in the system.

(9-28) W = L q / λ

• Average time a customer or unit spends waiting in line for service.

(9-29) W = Wq + 1 / μ

• Average time a customer or unit spends in the system.

(9-30) P0 = 1 – λ / μ

• Probability that there are zero customers or units in the system.

Equations 9-31 through 9-38 describe the operating characteristics in a multiple-server queuing system that has Poisson
arrivals, exponential service times, and a finite population of size N.

λ = average number of arrivals per time period (e.g., per hour)

μ = average number of people or items served per time period
s = number of servers
N = size of the population

(9-31)

• Probability that there are zero customers or units in the system.

(9-32)

• Probability that there are exactly n customers in the system, for 0 ≤ n ≤ s.

(9-33)

• Probability that there are exactly n customers in the system, for s ≤ n ≤ N.

(9-34)

• Probability that there are exactly n customers in the system, for n > N.

(9-35)

• Average number of customers or units waiting in line for service.

(9-36)
 • Average number of customers or units in the system.

(9-37)

• Average time a customer or unit spends waiting in line for service.

(9-38)

• Average time a customer or unit spends in the system.

Copyright © 1995 - 2014 Pearson Education . All rights reserved. Pearson Prentice Hall is an imprint of Pearson .
Legal Notice | Privacy Policy | Permissions