WAITING LINE ANALYSIS

Lecture 13
 WAITING LINE ANALYSIS
• Waiting Line Analysis
– Waiting line analysis is also named as queuing
model analysis or queuing theory.
– Queuing theory is the mathematical study of
waiting lines or queues. In queuing theory a model
is constructed so that queue lengths and waiting
lines could be predicted.
 WAITING LINE ANALYSIS
• Major components of Queuing model.
Following are the major components of queuing
model:
 WAITING LINE ANALYSIS
– Customer
The arriving unit that requires some service to
be performed. The customers could persons,
machines, parts, vehicles etc.
– Queue (waiting line)
The number of customers waiting to be
served. The queue does not include customers that
are served.
 WAITING LINE ANALYSIS
– Service channel
– The process or facility which is performing the
services to the customers. This may be single
channel (one server) or multi channel (more than
one server).
 WAITING LINE ANALYSIS
• Elements of Queuing system (Structure of a Queuing
system)
– Arrival Distribution
It represents the pattern in which the number of
customers arrives at the service facility. (arrival rate)
– Service (departure) Distribution
It represents the pattern in which the number of
customers leave the service facility. (service rate)
– Service Channel
The queuing system may have a single or multi service
channel.
 WAITING LINE ANALYSIS
– Service Discipline
– It is the rule by which customers are selected from
the queue for service.
• FCFS (First Come First Serve)
– FIFO (First In First Out) e.g. Doctor clinic
• LCFS (Last Come First Serve)
– LIFO (Last In First Out) e.g. medicine shop
• SIRO (Service in Random Order)
• Priority (on many basis like emergency patient)
 WAITING LINE ANALYSIS
– Maximum Number of Customers Allowed in the System
Maximum number of customers in the system can
be either finite (like doctor patients/movie) or infinite
(customers in a mall).
– Calling Source or Population
Finite (few potential customers)
Infinite (large number of potential customers)
– Customers Behavior
Patience
Impatience (balking, reneging, joking)
 WAITING LINE ANALYSIS
• Operating Characteristics of a Queuing Model
 WAITING LINE ANALYSIS
– Queue Length (Lq)
This is the average number of customers in the
queue who are waiting to get the service. This exclude
customers who are being served.
– Service length (Ls)
This is the average number of customers in the
system including those who are waiting for the service
and those who are getting service.
– Waiting time in the Queue (Wq)
The average time for which a customer has to wait
in the queue to get service.
 WAITING LINE ANALYSIS
– Total time in the system (Ws)
– The average total time spent by a customer in the
system from the moment he arrives till he leaves
the system. It is taken to be the waiting time plus
the service time
– Utilization Factor (ρ)
– It is the proportion of time a server actually
spends with the customers. It is also called ‘traffic
intensity’.
 WAITING LINE ANALYSIS
Transient and steady states of the system
• Transient state
– Queuing theory analysis involves the study of
system’s behavior over time. If the operating
characteristics (behavior of the system) vary with
time, it is said to be in ‘transient state’.
• Steady state
– A system is said to be in steady state condition if its
behavior becomes independent of its initial
conditions and of elapsed time.
 WAITING LINE ANALYSIS
• Explosive State
– When queue length is infinitely getting increased,
such state is named as explosive state. Arrival rate
is higher then the service rate.
 WAITING LINE ANALYSIS
Kendall’s notations for representing queue models:
– (a/b/c) : (d/e)
Where
a is arrival distribution
b is service time (or departure) distribution.
– M is Markovian (poisson) arrival or departure
distribution or exponential inter arrival or service time
distribution.
– Ek is Erlangian or gamma interval or service time
distribution with parameter k
 WAITING LINE ANALYSIS
– GI is general independent arrival distribution.
– G is general departure distribution.
– D is deterministic interval or service time.
C is number of parallel service channels in the system.
– 1 Single server
– S Fixed number of server.
D is the maximum number of customers in the system.
– ∞ is infinite number of customers.
– N is finite number of customers.
 WAITING LINE ANALYSIS
e is Queue core service discipline
– FCFS is First Come First Serve.
– LCFS is Last Come First Serve.
– SIRO is Service in Random Order.
– GD is General Discipline
 WAITING LINE ANALYSIS
• Classification of Queuing Model
Probabilistic QM Deterministic QM Mixed QM
• Erlang Model
(M/M/1) : (∞/FCFS)
• General Erlang
(M/M/1) : (∞/FCFS)
• (M/M/1) : (N/FCFS)
• (M/M/S) : (∞/FCFS)
• (M/Ek/1) : (∞/FCFS)
• Machine Repairing
Model
(M/M/R) : (K/GD), K˃R
• Power Supply Model
 WAITING LINE ANALYSIS
Economic Cost Profit (D/D/1) : (K-1/FCFS) (M/D/1) : (∞/FCFS)
Model
(M/G/1) : (∞/GD)
 WAITING LINE ANALYSIS
• Model 1: (M/M/1) : (∞/FCFS)
List of symbols and formulas
– n= number of customers in the system.
– λ= arrival rate (number of arrivals per unit of time)
– μ= service rate per busy server (number of customers served
per unit of time)
– ρ = Traffic Intensity
ρ = λ/μ
– Lq = Expected (average) number of customer in the queue
Lq = Ls – λ/μ = λ/μ x λ/μ-λ
 WAITING LINE ANALYSIS
– Ls = expected number of customers in the system (waiting + being
served)
Ls = λ/μ = λ/μ-λ
(1- λ/μ)

– Ws = Expected time a customer spends in the system (waiting + being

served)
Ws = Ls/λ = λ = 1/(μ-λ)
λ(μ-λ)
– Wq = expected waiting time per customer in the queue

Wq = Ws – 1/μ = λ
μ(μ-λ)
 WAITING LINE ANALYSIS
– Ln = average length of non empty queue
Ln = μ/μ-λ
– Wn = average waiting time in non empty queue
Wn = 1/μ-λ
 WAITING LINE ANALYSIS
• A self service store employs 1 cashier at its counter. 9
customers arrive on an average every 5 minutes while the
cashier can serve 10 customers in 5 minutes. Assuming
poison distribution for arrival rate and exponential
distribution for service time. Find 1) average number of
customers in the system, 2) average number of customers in
the queue or average queue length, 3) average time a
customer spends in the system, 4) average time a customer
waits before being served.
• Solution
– λ = Arrival rate = 9/5 = 1.8 customers per minute
– μ = Service rate = 10/5 = 2 customers per minute
 WAITING LINE ANALYSIS
1) Ls = λ/μ-λ = 1.8/2-1.8 = 9 customers

2) Lq = λ/μ x λ/μ-λ = 1.8/2 x 1.2/2-1.8 = 8.1

customers

3) Ws = 1/(μ-λ) = 1/(2-1.8) = 5 minutes

4) Wq = λ = 1.8/2(2-1.8) = 4.5 minutes

μ(μ-λ)
 WAITING LINE ANALYSIS
• A person repairing radios, find that the time spent on
the radio sets has exponential distribution with mean
20 minutes. If the radios are repaired in the order in
which they came in and their arrival is approximately
Poisson with an average rate of 15 for 8 hours day, what
is the repairman’s expected idle time each day?, how
many jobs are ahead of the average set just brought in?
• Solution
– Arrival rate (λ) = 15/8x60 = 1/32 units or radios per minutes
– Service rate (μ) = 1/20 units per minutes
 WAITING LINE ANALYSIS
Average number of jobs in the system
Ls = λ/μ-λ = 1/32 = 1/32 x 20 x 32 = 20/12 = 1.67 Jobs
1/20 – 1/32 32-20
Number of hours for which the repairman busy in an 8 hours a
day
8 x λ/μ = 8 x 1/32 x 20/1 = 5 hours
Time for which repairman remains idle in an 8 hours day
= 8-5 = 3 hours
 WAITING LINE ANALYSIS
Model 1 (M/M/1) : (∞/FCFS)
• A branch of a bank has only one typist. Since the typing work
varies in length. The typing rate is randomly distributed
approximating a Poisson distribution with mean service rate of 8
letters per hour. The letters arrive at a rate of 5 per hour during
the entire 8 hours working day. If the typewriter is valued at 1.50
per hour, determine 1) equipment utilization, 2) the percent time
an arriving letter has to wait, 3) average system time, 4) average
cost due to waiting on the part of the typewriter per day.
• Solution
– Arrival rate (λ) = 5 letters per hour
– Service rate (μ) = 8 letters per hour
 WAITING LINE ANALYSIS
1) e = λ/μ = 5/8 = 0.625

2) = 0.625 x 100 = 62.5%

3) Ws = 1/μ-λ = 1/8-5 = 1/3 hours = 1/3 x 60 = 20 minutes

4) Busy time = 8 x 5/8 = 5 hours

Remaining idle = 8-5 = 3 hours
We are paying 1.50, so, 3 x 1.50 = 4.50
 WAITING LINE ANALYSIS
Model 2 (M/M/1) : (∞/FCFS)
[arrival and service rates depends upon the
length of the queue]
Pn = ρn/n! x e-p
Pi’s in equation are the values of the Poisson distribution with
parameter ρ.
 WAITING LINE ANALYSIS
Example:
A sipping company has single unloading dock with ships arriving in the
Poisson fashion at an average rate of 3 per day. The unloading time
distribution for a ship with n unloading crews is found to be exponential
with average unloading time ½ days. The company has a large labor
supply without regular working hours, and to avoid long waiting times,
the company has a policy of using as many unloading crews as there are
ships waiting in line or being unloaded. Find: a) the average number of
unloading crews working at any time. b) the probability that more than
4 crews will be needed.
• Solution
– Arrival rate (λ) = 3 ships per day
– Service rate (μ) = 2 ships per day
WAITING LINE ANALYSIS