QUEUING THEORY

Week 13
REVIEW OF QUEUING
THEORY
Why Queue is formed
Why Queue is formed
Queue is formed for two possible reasons.
• Number of customers > number of servers
• Server do not work efficiently and takes more time than
the prescribed to serve a customer
Contd
• Arrival pattern ( Random or fixed). ( Random implies
Poisson distribution)
• Mean arrival rate()
• Mean service rate()
• Mean time between arrival()
Model I
(M/M/1):(/FCFS)
• It is also called Single server unlimited queue. Its
assumptions are . The formulae for this model are
Example 1
Example 1
Example 1
Example 1
Example 1
Model II
(M/M/1):(/FCFS)
• Here it could be possible that . The formulae for this
model are
Example 2
• Trains arrive at the yard every 15 minutes and service
time is 32 minutes. If the capacity of the yard is limited to
4 trains. Find
I. Probability that yard is empty.
II. Average number of trains in the system.
Model III
(M/M/c):(/FCFS)
• This model has one queue and multiple servers in
parallel. Here c represents multiple servers. There could
be two possibilities
I. n<c
for this case every server will have its service rate. we
can have lets say 4 servers and 3 of them are busy.
Therefore combined service rate in this case will depend on
number of customers n. This implies
=n
Also it shows that (n-c) servers are idle.
Model III
(M/M/c):(/FCFS)
II.For the second case c, since every server has its
service rate But all the servers are busy , therefore the
combined service rate depends upon server. This
implies =c
Thus we can say that

For formulas page 658 (reference: Operations

Research an Introduction by Taha. 9th edition)
Example 3
Example 3
Example 3
Example 3
Example 4
• At a warehouse, vehicles arrive at a rate of 18 per hour
following Poisson distribution. The unloading time of the
vehicles following exponential distribution with unloading
rate of 6 vehicles per hour. If there are four unloading
crews. Find the following

• , , and
Example 5
Example 5
Example 5
Example 5
Model IV
(M/M/c):(/FCFS)
This model is also called single queue multi server with
limited capacity. This model represents the situation in
which the system has c servers and can accommodate
only finite number of N arrivals.
For formulas page 662 (reference: Operations
Research an Introduction by Taha. 9th edition)
Example
At a port there are 6 unloading berths and 4 unloading
crews. When all the berths are full, the arriving tankers are
directed to an overflow facility 20 kms down the river.
Tankers arrive according to poisson process with mean of 1
every 2 hour. It takes for an unloading crew on an average
10 hours to unload a tanker, the unloading time follows
exponential distribution. Find
a) How many tankers are at the port on average?
b) How long does a tanker spend at the port on average?
c) What is the average arrival rate at the overflow facility?
Example
• An auto mobile inspection station has 3 inspection stalls.
Assume that cars wait in such a way that when stall
becomes vacant, the cars at the head of the line pulls up
to it. The station can accommodate at most 4 cars eaiting
at one time. The arrival pattern is Poisson with mean of 1
car every minute during the peak hours. The service time
is exponential with mean 6 minutes. Find the average
number of cars in the system during peak hours, the
average waiting time and the average number of cars per
hour that cannot enter the station because of full capacity.
QUEUING MODEL
EXAMPLES
Example
Example
Example