0% found this document useful (0 votes)
11 views7 pages

Understanding Waiting Line Theory

This document discusses waiting line models and their uses. It covers: 1. Why waiting lines form due to a mismatch between customer arrival rates and service rates. 2. Common uses of waiting line theory include analyzing service systems and determining optimal service rates. 3. Waiting line models consider factors like customer populations, service arrangements, priority rules, arrival and service time distributions, and operating characteristics like utilization, average time in the system, and average wait times.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views7 pages

Understanding Waiting Line Theory

This document discusses waiting line models and their uses. It covers: 1. Why waiting lines form due to a mismatch between customer arrival rates and service rates. 2. Common uses of waiting line theory include analyzing service systems and determining optimal service rates. 3. Waiting line models consider factors like customer populations, service arrangements, priority rules, arrival and service time distributions, and operating characteristics like utilization, average time in the system, and average wait times.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Module

D Waiting Lines
A. Why Waiting Lines Form
1. Define “customers” in waiting lines.

2. Why waiting lines form?

3. When do no waiting lines form?

B. Uses of Waiting-Line Theory


1. Service is the act of processing a customer (or manufacturing job).

2. Examples:

C. Structure of Waiting Line Problems


1. Customer population

2. The service system


Waiting Lines

Arrangement of service facilities


• Single-channel, single-phase

• Single-channel, multiple-phase

• Multiple-channel, single-phase

• Multiple-channel, multiple-phase

• Mixed arrangement

Mixed Arrangement Routing for


Routing for
: 1–
1–2–4
: 2–
2–4–3
Routing for : 3–
3–2–1–4

Service Service
facility 1 facility 2

Service Service
facility 3 facility 4

3. Priority rule
a.
b.
c.

2
Waiting Lines

D. Probability Distributions
1. Arrival distribution
2. Customer arrivals can often be described by the Poisson distribution with mean = λT
and variance also = λT
a. Arrival rate:
b. Interarrival times

Pn =
(λ T )n − λ T
e for n = 0,1,2,…
n!

Where
Pn = Probability of n arrivals in T time periods
λ= Average numbers of customer arrivals per period
e= 2.7183
3. Service time distribution can be described by an exponential distribution with mean
= 1/µ and variance = (1/µ )2
a. Service time:

P (t ≤ T ) = 1 − e − µT

Where
µ= Average number of customers completing service per period
t= Service time of the customer
T= Target service time
b. The exponential distribution assumes that each service time is independent of
those that preceded it.

E. Using Waiting Line Models to Analyze Operations


1. Waiting line operating characteristics
a.

b.

c.

d.

e.

3
Waiting Lines

2. Single-server model

a. assumptions
Number of servers:
Number of phases:
Customer population (input source):
Arrival distribution:
Service distribution:
Priority rule:
Waiting line:
b. Formulas
λ
ρ= Average utilization of system =
µ
Pn = Probability that n customers are in the system = (1 − ρ )ρ n
λ
L= Average number of customers in the service system =
µ −λ
Lq = Average number of customers in the waiting line = ρL
1
W = Average time spent in the system, including service =
µ −λ
Wq = Average waiting time in line = ρW

c. Application 1: Single Server Model


Customers arrive at a checkout counter at an average 20 per hour, according to a
Poisson distribution. They are served at an average rate of 25 per hour, with
exponential service times. Use the single-server model to estimate the operating
characteristic of this system.
λ = 20 customer arrival rate per hour
µ = 25 customer service rate per hour
λ
1. Average utilization of system ρ= =
µ
λ
2. Average number of customers in the service system L= =
µ −λ
3. Average number of customers in the waiting line L q = ρL =
1
4. Average time spent in the system, including service W = =
µ −λ
5. Average waiting time in line W q = ρW =

4
Waiting Lines

d. Application 2: Analyzing the Service Rate


In the checkout counter example, what service rate is required to have customers
average only 10 minutes in the system?

1
W = = 0.17 hr (or 10 minutes)
(µ − λ )
0.17(µ − λ ) = 1 , where λ = 20 customers arrival rate per hour

µ=

3. Multiple-server model

a. Assumptions (in addition to single-server model)

b. Formulas
λ
ρ= Average utilization of system =

−1
 s −1 (λ µ )n (λ µ )s  1 
P0 = Probability that zero customers are in the system = ∑ +  
 n = 0 n ! s!  1 − ρ 
 (λ µ )n
 P0 0 < n < s
 n!
Pn = Probability that n customers are in the system =
 (λ µ ) P n ≥ s
n

 s! s n − s 0
P0 (λ µ ) ρ
s
Lq = Average number of customers in the waiting line =
s!(1 − ρ )
2

Lq
Wq = Average waiting time of customers in line =
λ
1
W= Average time spent in the system, including service = Wq +
µ
L= Average number of customers in the service system = λW

c. Application 3: Multiple-Server Model


Suppose the manager of the checkout system decides to add another counter. The
arrival rate is still 20 customers per hour, but now each checkout counter will be
designed to service customers at the rate of 12.5 per hour. What is the waiting time
in line of the new system?
s = 2 , µ = 12.5 customers per hour, λ = 20 customers per hour

5
Waiting Lines

1. Average utilization λ
ρ= =
of system sµ
2. 1
P0 = =
 λ 
S

Probability that    
zero customers 1 + λ +  µ   1 
 
 µ
 1 − ρ 
are in the system s

 
3. Average number P0 (λ µ ) ρ
s

of customers in Lq = =
s!(1 − ρ )
2
the waiting line
4. Average waiting Lq
time of customers Wq = = hrs (or ______ minutes)
in line λ

4. Little’s Law

5. Finite-source model
a. Assumptions

b. Formulas
−1
N N!  λ  
n

P0 = Probability that zero customers are in the system = ∑   


 n = 0 ( N − n )!  µ  
ρ= Average utilization of the server = 1 − P0
λ+µ
Lq = Average number of customers in the waiting line =N− (1 − P0 )
λ
µ
L= Average number of customers in the service system =N− (1 − P0 )
λ
= Lq [( N − L )λ ]
−1
Wq = Average waiting time in line
= L[( N − L )λ ]
−1
W = Average time spent in the system, including service

6
Waiting Lines

c. Application 4: Finite-Source Model


DBT Bank has 8 copy machines located in various offices throughout the building.
Each machine is used continuously and has an average time between failures of 50
hours. Once failed, it takes 4 hours for the service company to send a repair person
to have it fixed. What is the average number of copy machines in repair or waiting to
be repaired?
λ = 1 50 = 0.02 copiers per hour, µ = 1 4 = 0.25 copiers per hour
−1
N N!  λ  
n

P0 = ∑   
Probability that zero  n =0 ( N − n )!  µ  
1. customers are in the
1
system = =
 8! 8! 8! 8
 8! (0.08) + 7! (0.08) + ⋯ = 0 (0.08) 
0 1

 
Average utilization of ρ = 1 − P0 =
2.
the server
Average number of µ
3. customers in the service L=N− (1 − P0 ) =
system λ

d. Application 5: Hilltop Produce


The Hilltop Produce store is staffed by one checkout clerk. The average checkout time is
exponentially distributed around an average of two minutes per customer. An average of
20 customers arrive per hour.
a. What is the average utilization rate?
λ
ρ= =
µ
b. What is the probability that three or more customers will be in the checkout area?
P0 = (1 − ρ )ρ 0 =
P1 = (1 − ρ )ρ 1 =
P2 = (1 − ρ )ρ 2 =
c. What is the average number of customers in the waiting line?
 λ 
Lq = ρL = ρ   =
µ −λ 
d. If the customer spends an average of 10 minutes shopping for produce, what is
the average time customers spend in the store?
1
W= =
µ −λ

Common questions

Powered by AI

Adding an extra service channel can significantly reduce the average waiting time in the system. For example, if the checkout system adds another counter, and each counter services customers at the rate of 12.5 per hour with an arrival rate of 20 customers per hour, the average utilization decreases, leading to reduced waiting time. This is because the service capacity effectively doubles, splitting the incoming load across two channels, thus reducing congestion and resulting delays .

Finite-source models limit the number of customers that can potentially enter the system at any time, reflecting scenarios where the customer base is restricted, such as a specific group of machines requiring maintenance. In contrast, infinite-source models assume an inexhaustible population, like a store open to the public. Finite-source models often lead to less queue formation despite high utilization because the finite population limits arrivals. This results in more predictable and stable system performance metrics, making it essential for systems with known and limited customer pools .

Little's Law provides a fundamental relationship in waiting line theory, stating that the long-term average number of customers in the system (L) is equal to the product of the arrival rate (λ) and the average time a customer spends in the system (W). This law is significant as it holds for a wide variety of systems in a stable state, allowing for insight into performance measures without requiring detailed knowledge of the system's specific stochastic processes. It enables analysts to predict one measure of system performance if the other two are known, making it invaluable for capacity planning and operational analysis .

Customer arrival rate (λ) and service rate (µ) are crucial metrics in determining the operational characteristics of a single-server queue because they directly impact the system's ability to process customers efficiently. The ratio λ/µ, known as the utilization factor (ρ), determines the occupancy level of the server; a utilization factor approaching 1 indicates high congestion and potential delays. The arrival and service rates also influence key performance indicators such as average waiting time, the average number of customers in the system, and the probability of delays in service. These metrics provide insights essential for optimizing system performance and ensuring a balance between customer satisfaction and resource utilization .

The priority rule in waiting lines defines the sequence in which customers are selected for service. Common priority rules include First-Come-First-Served (FCFS), Shortest Processing Time (SPT), and priority based on customer class. These rules affect the efficiency of customer service by determining which customers are served first, influencing average waiting time, and potentially affecting service fairness and overall system throughput. For instance, FCFS may ensure fairness but could lead to higher waiting times, whereas SPT can minimize waiting times but may prioritize certain customers over others .

The Poisson distribution is often used to model customer arrivals in waiting line scenarios because it effectively describes the probability of a number of discrete events occurring within a fixed period, provided these events occur with a known constant mean rate and independently of the time since the last event. This makes it particularly suitable for modeling customer arrivals, where the number of arrivals can be considered independent and uniformly distributed over time .

Waiting lines form primarily because of a mismatch between the demand for service and the available service capacity. When the demand exceeds the service capacity at any given time, customers accumulate in the system, creating a queue. Conversely, no waiting lines form when the average service rate meets or exceeds the customer arrival rate continuously, preventing any backlog from forming .

A mixed arrangement in service facilities refers to a configuration where elements of both series and parallel arrangements are used. This setup allows for flexibility in how customers are routed through the system, which can optimize service efficiency. For example, in a mixed arrangement, Facility 1 might route customers to Facility 2 or Facility 4, while Facility 3 could route back to Facility 1 or jump to Facility 4, depending on current workloads or service requirements. This flexibility can reduce bottlenecks and improve system throughput by dynamically adjusting to demand variations .

The assumption of exponentially distributed service times implies that the service times are memoryless, meaning the probability of completing a service in the next interval is independent of how long the service has already taken. This simplifies mathematical modeling and facilitates the derivation of closed-form solutions for various system performance measures. However, this assumption may not always hold in practical scenarios, leading to potential discrepancies between analytical predictions and real-world observations. Such assumptions are critical in waiting line models as they influence the accuracy of analytical tools used to guide resource allocation and capacity planning .

To reduce the average time customers spend in a service system, strategies such as increasing service capacity by adding more service channels, optimizing scheduling and staffing to better match peak demand timings, and implementing technology solutions like self-service kiosks that expedite service delivery can be effective. Additionally, process improvement techniques like queue management systems and priority rule adjustments that optimize service order based on customer needs can significantly decrease waiting times, enhancing overall system efficiency and customer satisfaction .

You might also like