Queuing Theory

QUEUING THEORY
QUEUING THEORY
 Also called waiting line theory.
 It is most appropriate for the service oriented
firms. Where customers arrive randomly
expecting to receive a service at a service facility.
 In general we do not like to wait.
 Reduction of the waiting time usually requires
extra investments.
 So we need models and techniques to analyze
such situations.
WHY SHOULD CUSTOMERS WAIT TO
FORM A QUEUE?
 The existing capacity to provide the required service
less than the existing demand for that service.
 variability in the arrival pattern of the customers.
 variability in time required to provide the service need
 the service facility remains idle awaiting arrival of
customers for service.
 Hence Queues may form because:
 Customers wait to be given service or
 Idle service facility waits to provide service.
Applications of queuing models
 production systems
 transportation
 stocking systems
 communication systems
 information processing systems
Examples of applications
• Supermarket.
 How long do customers have to wait at the checkouts?
 What happens with the waiting time during peak-
hours?
 Are there enough checkouts?
• Production system.
 What is the production lead time of an order?
 What is the reduction in the lead time
 when we have an extra machine?
 Should we assign priorities to the orders?
• Parking place.
If they are going to make a new parking place in
front of a super market. How large should it
be?
• Traffic lights.
How do we have to regulate traffic lights such
that the waiting times are acceptable?
• Call centers of an insurance company
 How long do customers have to wait before
an operator becomes available?
 Are there enough operators? Pooling teams?
COMPONENTS OF QUEUING SYSTEM
 Input sources
 calling units
 Queues
 service facility
 served units.
ARRIVAL PROCESS OF CALLING UNITS
MODE OF ARRIVAL
 bulk arrival
 single arrivals.
 independent
 Conditional
timing of arrivals
• Uniform arrivals
 Where the amount of time separating each arrival is the same e.g.
arrival of a component in an automated assembly line
 arrival is deterministic.
• Random arrival
 This is where the calling units arrive randomly and the inter-arrival
times also vary randomly with unpredictable periods of times
separating the arrivals.
 Most queuing problems are represented by this process.
 Frequently, the arrival pattern is modelled as a poisson process.
 In this process the arrival or non- arrival of a customer in the
interval is not influenced in any way by what has happened at
earlier times. The mean arrival rate or the average number of
customers arriving in one unit of time is often represented by
Greek letter Lambda ‫ג‬
SERVICE MECHANISM
• Structure of service system and speed of service
SPEED OF SERVICE
 Service rate
 Service time
Service rate describes the average number of
customers served per unit of time
service time indicate the average amount of time
to serve one customer.
service times
• assumption that service times are
exponentially distributed about some average
service time, this is often represented by
Greek letter “u”
QUEUE DISCIPLINE
 Refers to the order by which customers are

picked from the queue for a service.
 FIRST-COME FIRST SERVED. (FCFS)
 LAST-COME FIRST SERVED (LCFS)
 SIRO=SERVICE-IN-RANDOM SERVICE ORDER
 PRIORITY SERVICE.
BASIC QUEUING CHARACTERISTICS
1. P0=1-λ/μ =Represents the probability of an empty or idle facility.

2. P1=λ/μ =Represents the probability that a service channel is busy i.e. the
traffic intensity or utilization factor.
3. Pn=(λ/μ)n * (1-λ/μ) Represents the probability that there are n customers in
the service system.
4. Ls=λ/μ-λ Represents the average or expected number of customers in the
queuing system
5. Lq=(λ/μ )(λ/μ-λ) = λ2/μ(μ-λ) Represents the average or expected number of
customers in the queue.
6. Ws=1/μ-λ Represents the average or expected time a customer spends in
the queuing system.
7. Wq=(λ/μ) (1/μ-λ) =λ/μ(μ-λ) Represents the average or expected time o a
customer spends in the queue.
8. P(≥n)=(λ/μ)n Represents the probability of the queue length being ≥n.
SINGLE SERVER MODEL
 Standard model where there is a single server with calling units

arriving randomly.
 calling units require varying service times.
 This model can be fitted in situations where the following
assumptions are satisfied:
 There is a single server and single queue with no restriction to the
Length of the queue.
 The No. of arrivals per unit of time is described by poisson
distribution. The mean arrival rate is denoted by λ
 The service time has exponential distribution. The average service rate
denoted by μ
 Arrivals are from the infinite source / population.
 Customers are served on a first come first served basis.
 The mean arrival rate is < mean service rate (λ<μ)
Example 1
A supermarket has two salesmen at the sales counter
where customers arrive according to Poisson
distribution at the rate of 10 per hour. If the service
time is exponential with a mean of 4 minutes, find:
i.Expected number of customers in the supermarket
ii.Average waiting time for a customer before getting a

service
iii.Percentage idle time for the salesmen
Example 2
A university cafeteria line in the student centre is a self service facility in
which students select the food items they want and then form a single
line to pay the cashier. Students arrive at a rate of four per minute
according to a Poisson distribution. The single cashier ringing up sales
takes about 12 seconds per customer, following an exponential
distribution.
i.What is the probability that there are more than two students in the
system
ii.What is the probability that the system is empty
iii.How long will the student wait average to before reaching the cashiers
iv.What is the expected number of students in the queue

v.What is the average number of students in the system

Queuing Theory

Uploaded by

Copyright:

Available Formats

Queuing Theory

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Queuing Theory

Uploaded by

Copyright:

Available Formats

QUEUING THEORY

 Refers to the order by which customers are

1. P0=1-λ/μ =Represents the probability of an empty or idle facility.

 Standard model where there is a single server with calling units

ii.Average waiting time for a customer before getting a

iv.What is the expected number of students in the queue

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.