5/23/2017

QUEUING THEORY
 Used in service oriented, M/C
repair shops, in case of semi
finished product waiting for
finishing operation.

QUEUING THEORY
 Helps managers to better
understand systems in
manufacturing, service, and
maintenance

 Provides competitive
advantage and cost saving

A QUEUE REPRESENTS ITEMS

OR PEOPLE AWAITING SERVICE

Components of a Basic Queuing Process

THE QUEUING COST
TRADE-OFF Input Source The Queuing System
Cost

Total Cost Served

Minimum Cost of Providing Calling Jobs Service Jobs
Queue Mechanism
Total
Service Population
leave the
Cost
system

Cost of Waiting
Time

Low Level Optimal Service High Level

Of Service Level Of Service

Characteristics of C:- Theorem :-

1. Arrival pattern of customer:-  If n, the number of arrivals in t, follow the

 It can be spaced by equal and unequal time Poisson distribution,
intervals however in most of the cases
random arrival is observed which is best e  t (  t ) n
described by POISSON process. If the arrivals
are governed by Poisson process then the n!
time between successive arrival is NEGATIVE  Then T (inter-arrival time) obeys the negative
EXPONENTIALLY distributed.

 e  T
exponential law
 The mean arrival rate is denoted by λ

1
 5/23/2017

Characteristics of queuing model:- Characteristics of queuing model:-

2. Service pattern :- 3. The Queue Discipline:-
 Unlike arrival process there is no standard probability
distribution for service process. In fact in many cases  It is a rule according to which the customers are
actual data is used for describing the service time.
However if the service time are EXPONENTIALLY selected for service when a queue has been
DISTRIBUTED then the Queuing model become simple. formed. The most common disciplines are
 If there is infinite number of servers then all the
customers are served instantaneously on arrival, and a) FCFS
there will be no queue. b) FIFO
 The mean service rate is denoted by µ c) LIFO
d) SIRO

Characteristics of queuing model:- Characteristics of queuing model:-

4. Customer behavior :- 5. Size of population :-
 In most of the cases the capacity of the system is
limited . The entire sample of customer from
which a few visit the service facility is know as
BALKING RENEGING JOCKEYING calling population.
When the Customer enters switching of  Size of calling population can be finite or infinite.
queues
customer the queue but  In a railway booking counter the total number of
decided not to leaves after some potential passengers so large that although
enter the queue time tie without theoretically finite it can be regarded as infinite
if the queue is getting service for all the practical purposes.
very long

Kendall’s Notation For Representing

Queuing Models ρ= μλ
(a|b|c) : (d|e) Traffic intensity factor or utilization factor or
channel efficiency or percentage time the
a = Probability distribution of arrival time server is busy or probability that the customer
b = probability distribution of service time has to wait.
c = Number of Servers The average service rate must always exceed
d = capacity of the system (size of calling
population)
the average arrival rate. μ>λ
e = Queue Discipline
Otherwise, the queue will grow to infinity

2
 5/23/2017

Model I (M|M|1) : (∞|FCFS) Ls = Expected system/line length i.e., expected

number of customers in the system
this denotes a Queuing model in which ρ
1ρ
arrivals are generated by Poisson Process
(inter arrival time are exponentially
distributed), service time are exponentially
distribute has single server, infinite calling Lq = Expected queue length i.e., expected number
of customers in the Queue
population & service rule FCFS.
L q = Ls - ρ

 Wq = Expected waiting time per customer in the

Queue.
λ Po = Probability that the service facility is Idle or
there are Zero customer in system

μ(μ  λ)
Probability that the customer does not have

1 ρ
to wait

Ws = Expected waiting time per customer in the

system
1 Pn = Probability of n customer in the system
Ws =Wq +
n  P
μ
o

P(Ws≥t)= Probability that the waiting time in

the system is greater than equal to t

Ln = Expected length of Non-empty

Queue e  (μλ)t
1
1ρ
P(Wq≥t)= Probability that the waiting time in Little’s law
the Queue is greater than equal to t

ρe  (μλ)t L  W Lq  Wq

3
 5/23/2017

GATE-2008
In an M/M/1 queuing system, the number of
arrivals in an interval of length T is a Poisson
random variable (i.e. the probability of there
being n arrivals in an interval of length T is
e  t (  t ) n
n!
The probability density function f(t) of the
inter-arrival time
GATE-2000
• In a single serve infinite population queuing
model, arrivals follow a Poisson distribution
with mean λ = 4 per hour. The service times
are exponential with mean service time
equal to 12 minutes. The expected length of
the queue will be:
(a) 4 (b) 3.2 (c) 1.25 (d) 5

Ans. (b)

Ans. (c)

GATE-1997 GATE-1999
The cost of providing service in a queuing At a production machine, parts arrive
system increases with according to a Poisson process at the rate of
0.35 parts per minute. Processing time for
(a) Increased mean time in the queue parts have exponential distribution with
(b) Increased arrival rate mean of 2 minutes. What is the probability
(c) Decreased mean time in the queue that a random part arrival finds that there
are already 8 parts in the system (in machine!
(d) Decreased arrival rate in queue)?
(a) 0.0247 (b) 0.0576 (c) 0.0173 (d) 0.082
Ans. (c)

Ans. (c)

GATE 2014
  0.35 min 1;   0.5 min 1 • Jobs arrive at a facility at an average rate of 5
in an 8 hour shift. The arrival of the jobs
    
n
follows Poisson distribution. The average
Pn  1     0.0173
    
service time of a job on the facility is 40
minutes. The service time follows exponential
distribution. Idle time (in hours) at the facility
per shift will be

4
 5/23/2017

GATE 2014
• At a work station, 5 jobs arrive every minute.
5 3
  hr 1;   hr 1 The mean time spent on each job in the work
8 2 station is 1/8 minute. The mean steady state
  7 number of jobs in the system is _______
Po  1   
   12
7 14 
idle time for shift  8  Ls 
12 3  

GATE 2016-SET-2 GATE-2006

• In a single-channel queuing model, the
customer arrival rate is 12 per hour and the
serving rate is 24 per hour. The expected time
2.5
that a customer is in queue is _______
minutes.
The number of customers arriving at a railway
reservation counter is Poisson distributed
with an arrival rate of eight customers per
hour. The reservation clerk at this counter
takes six minutes per customer on an average
with an exponentially distributed service
time. The average number of the customers
in the queue will be:
(a) 3 (b) 3.2 (c) 4 (d) 4.2
Ans. (b)

GATE-2004
A maintenance service facility has Poisson
arrival rates, negative exponential service time
and operates on a 'first come first served‘ queue
discipline. Breakdowns occur on an average of 3
per day with a range of zero to eight. The
maintenance crew can service an average of 6
machines per day with a range of zero to seven.
The mean waiting time for an item to be
serviced would be:
(a) 0.3 (b) 0.5 (c) 0.7 (d) 0.9
( a) 1/6 day (b) 1/3 day (c )1day (d )3day
Ans. (a)
GATE-2002
Arrivals at a telephone booth are considered
to be Poisson, with an average time of 10
minutes between successive arrivals. The
length of a phone call is distributed
exponentially with mean 3 min. The
probability that an arrival does not have to
wait before service is
Ans. (c)

5
 5/23/2017

GATE-2010 Model II (M|M|1) : (N|FCFS)

• Little’s law is a relationship between: • This model differs from that of Model I in the
(a) Stock level and lead time in an inventory sense that the maximum number of
system customers in the system is limited to N.
(b) Waiting time and length of the queue in a Arrivals will not exceed N in any case.
queuing system 1ρ
P0 =
(c) Number of machines and job due dates in a 1  ρ(N1)
scheduling problem
 1ρ  n
(d) Uncertainty in the activity time and project Pn =  (N 1) 
ρ
completion time
1  ρ 
Ans. (b)

Po  nρn
N
Ls =
n 0
P
10
1

Lq = L s - ρ
n
n 0

Po  P1  P2  .........P10  1

Po 1          ....    1
Ws = Ls / λ
2 3 4 10

 
1 
1 
Po 
Wq = Ws – (1/µ)
N 1

L.HOSPTL RULE
1 1
Po  
( N  1)  11
N

P11  (  ) Po 
11 1
11

Model No. III (M|G|1) : (∞|FCFS) Model IV (M|D|1) : (∞|FCFS)

General Service time Deterministic Service time

λ σ ρ
σ=0
2 2 2
Lq 
σ = standard deviation

2(1  ρ)
for service tie

Lq Ls  Lq  ρ
Wq 
λ 1
Ws  Wq 
μ