Scribd
Upload
81 views18 pages

Queuing Theory: Dr. Somesh Kumar Sharma MED NIT Hamirpur

This document provides an overview of queuing theory and queuing systems. Some key points: - Queuing theory deals with situations where customers arrive for service and may need to wait in line. Examples include people waiting at cash registers or planes waiting to land. - Queuing systems have inputs where customers arrive, a queue/waiting line, service facilities to provide service, and an output where customers leave. - Queuing situations can be classified based on arrival patterns, service system structure, queue structure, and service speed distributions. - Important characteristics of queuing systems include queue length, time in system, waiting time, and server idle time. - Queuing models can be deterministic or probabil

Uploaded by

devesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
81 views18 pages

Queuing Theory: Dr. Somesh Kumar Sharma MED NIT Hamirpur

This document provides an overview of queuing theory and queuing systems. Some key points: - Queuing theory deals with situations where customers arrive for service and may need to wait in line. Examples include people waiting at cash registers or planes waiting to land. - Queuing systems have inputs where customers arrive, a queue/waiting line, service facilities to provide service, and an output where customers leave. - Queuing situations can be classified based on arrival patterns, service system structure, queue structure, and service speed distributions. - Important characteristics of queuing systems include queue length, time in system, waiting time, and server idle time. - Queuing models can be deterministic or probabil

Uploaded by

devesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

Queuing Theory

Dr. Somesh Kumar Sharma


MED
NIT Hamirpur
Queuing Systems & Concepts
• The queuing theory also called the waiting line
theory.
• The theory is used in situations where the
‘customers’ arrive at some ‘service station(s)’ for
some service; wait (not desirable); and then leave
the system after getting the service.
• In such ‘arrival and departure’ problems, the
customers might be people waiting to deposit their
electricity bills at a cash counter, machines waiting to
be repaired in a factory’s repair shop, aero planes
waiting to land at an airport, patients in a hospital
who need treatment ……and so on.
Queuing Systems & Concepts
• The waiting lines develop because the service to a
customer may not be rendered immediately as the
customer reaches the service facility. Thus, lack of
adequate service facility would cause waiting lines of
customers to be formed.
• The only way that the service demand can be met
with ease is to increase the service capacity to the
existing level. The capacity might be built to such
high level as can always meet the peak demand with
no queues.
Continue…
• Providing too low service would cause excessive
waiting which has a cost in terms of customer
frustration, loss of goodwill in long run, direct cost of
idle employee.
• The goal of queuing modeling is the achievement of
an economic balance between the cost of providing
service and the cost associated with the wait
required for that service.
Queuing examples
Sr. No. Situation Arriving Customers Service Facility

1) Flow of automobile Automobiles Road network


traffic through a
road network

2) Sales of theatre Theatergoers Ticket booking


tickets window

3) Passage of Shoppers Checkout counters


customers through
a supermarket
checkout
General structure of a queuing system
Input
Population Service System
Queue

Arrival Process
Queue
Structure Service Mechanism

Customer Leave the System


Classification of Queuing Situation
1. On the basis of Arrival Process :-
a) According to source – the source of customers for
a queuing system can be infinite or finite. e. g. –
all people of a city or state (and others) could be
potential customers at a super bazar.
b) According to numbers – the customers may arrive
for service individually or in groups.
c) According to time – customers may arrive in the
system at known (regular or otherwise) times, or
they might arrive in a random way.
2. On the basis of Service System
There are two aspects of a service system :-
a) Structure of the service system, and
b) The speed of service
a) Structure of the service system :-
• A single service facility -
Service Facility
Queue Customers
Arrivals Leave
Multiple, parallel facilities with single queue

Service Stations

Queue Customers
Arrivals Leave
Multiple, parallel facilities with multiple queue

Queue Service Stations Customers


Arrivals Leave
Service facilities in a series
Service Station
Queue
Arrivals

Service Station
Customers Queue
Leave
b) Speed of Service
• The speed with which service is provided can be
expressed in either of two ways – as service rate and
as service time.
• If these service times are known exactly, the problem
can be handled easily. If these are different and not
known with certainly, we have to consider the
distribution of the service times in order to analyze
the queuing system.
• Generally queuing models are based on the
assumption that service times are exponentially
distributed about some average service time.
3. On the basis of Queue Structure
a) First – come – first – served
Order of service of customers is in the order of their arrival.
For example, a queue at the bus stop.
b) Last – come – first – served
Order of service of customer is in the reverse of their arrival.
For example, people is in elevator.
c) Service – in – random – order
The selection is made in a way that every customer in the
queue is equally likely to be selected.
d) Priority service
The customers may be called according to some identifiable
characteristics (length of job etc.) for service. For
example, Treatment of VIPs in a hospital.
Operating characteristics of a queuing
system
1. Queue length – the average number of customers in
the queue waiting to get service.
2. System length – the average number of customers in
the system, those waiting to be and those being
serviced.
3. Waiting time in the queue – the average time that a
customer has to wait in the queue to get service.
4. Total time in the system – the average time that a
customer spends in the system, from entry in the queue
to completion of service.
5. Server idle time – the relative frequency with which the
service system is idle. Idle time is directly related to
cost.
Queuing Models
• The queuing models can be categorized as being
deterministic or probabilistic.
• If each customer arrives at known intervals and the
service time is known with certainty, the queuing
model shall be deterministic in nature.
• Nearly all of the queuing models are of probabilistic
type.
Deterministic Queuing Models
• Symbolically, let the arrival rate be λ customers per
unit time and the service rate is μ customers per unit
time. Then,
If λ > μ the waiting line shall be formed which will increase
indefinitely; the service facility would always be busy; and
the service system will eventually fail; and
If λ ≤ μ there shall be no waiting time; the proportional of
time the service facility would be idle is 1 − λ/μ.
• The ratio λ/μ = ρ is called the average utilization, or
the traffic intensity, or the clearing ratio.
If ρ > 1, the system would ultimately fail, and
If ρ ≤ 1, the system works and ρ is proportional of time it is
busy.
Probabilistic Queuing Models
a) Poisson – exponential, single server model – infinite
population;
b) Poisson – exponential, single server model – finite
population; and
c) Poisson – exponential, multiple server model –
infinite population.
In each of these, the words ‘Poisson - exponential’
indicate that customer arrivals follow Poisson
distribution while the service times are distributed
exponentially.
Continue …
• If the arrivals are independent, with the average
arrival rate equal to λ per period of time, then,
according to the Poisson probability distribution, the
probability that n customers will arrive in the system
during a given interval T, is given by the following:

P(n customers during period T) = (e −m mn) / n!


where m = λT, and e = 2.7183

You might also like