UNIT – IV

QUEUEING MODELS
Introduction:

Waiting for service is part of our daily life. We wait at hotels, we queue up at the railway
reservation counter and line-up for service in banks and the waiting phenomenon is not an experience
limited to human beings alone jobs wait to be processed on a machine Aeroplanes circle in air before
given permission to land at an airport. Cars wait at the traffic signals and so on.

Queues are formed, if the demand for service is more than the capacity to provide the service.

Queueing system:

A Queueing system can be described as customers arriving for service, waiting if service is not
available immediately and leaving the system after having been served.

Characteristics of a queueing system:

1. Arrival (or) input pattern of customers

2. Service pattern (or) service mechanism of server.

3. Queue discipline

4. System capacity.

1. Arrival pattern:

Since the customers arrive in a random fashion, therefore their arrival refers or inter-arrival time
can be described interms of probabilities.

Mean arrival rate  Poisson distribution, Mean = 

Mean inter-arrival rate  Exponential distribution, mean = 1


2. Service Pattern:

The pattern according to which the customers are served i.e., Distribution of the time to service a
customer.

Service time  Poisson distribution, Mean= 

Inter service time  Exponential distribution mean= 1

 .
(i) Single Server:

(ii) Multi servers:

3. Queue Discipline:

It is the rule according to which customers are selected for service when a queue has been formed.
The common queue disciplines are

(i) FIFO – First In First Out (Or) FCFS – First Come First Served.

(ii) LIFO – Last In First Out (Or) LCFS – Last Come First Served.

(iii) SIRO – Service In Random Order (Or) Selected In Random Order.

(iv) GD – General Service Discipline

 There are also priority schemes for selection.

4. System Capacity:

In some queueing process, there is limited waiting space, So that when the queue reaches a certain
length, further customers are not allowed to join the queue, until the space becomes available after service
completion. Thus there is a finite limit to the maximum system size. If any number of customers are
allowed to join the queue, we may say that the capacity is infinite.

Customers Behaviour:

A customer generally behaves in four ways.

(i) Balking – A customer may leave the queue, if there is no waiting space.

(ii) Reneging – This occurs when the waiting customers leave the queue due to inpatients.

(iii) Priorities – In certain applications some customers are served before others, regardless of their order
of arrival.

(iv) Jockeying – The customer may jump one waiting line to another.

Transcient state:

A system is said to be transcient state then its operating characteristics are dependent on time.

Steady State:

The system is said to be steady state when the behaviour of the system is independent of time.

Let Pn (t ) denotes the probability that there are n units in the system at time t. Then the steady
state is lim Pn '(t )  0
n

Kendall’s Notation:

The assumptions made for the simples queueing model is (a|b|c): (d|e) where

a = Probability distribution of the inter-arrival time.

b = Probability distribution of the service time.

c = Number of services in the system.

d = Maximum number of customers allowed in the system.

e = Queue discipline.

Notations and Symbols:

The following notations and symbols will be used in connection with the queueing systems.
 n = Total number of customers in the system, both waiting and in service.

 = Average number of customers arriving per unit time.

 = Average number of customers being served per unit time.

C = Number of parallel service channels (servers).

Ls (or) E(n) = Expected or average number of customers in the system, both waiting and in service
[ Ls  E ( N s )]

Lq (or) E(M) = Average or expected number of customer in the queue (excluding those who are
receiving service) [ Lq  E ( N q )]

Ws (Or) E ( Ws ) = Average or expected waiting time of a customer in the system both waiting and in
service (Including the service time).

Wq (Or) E ( Wq ) = Average or expected waiting time of a customer in the queue. (Excluding service time)

Pn (t ) = Probability that there are n customers in the system at any time t (both waiting and in service)
assuming that the system has started its operation at time zero.

 = Traffic intensity or utilization factor, which represents the proportion of time the servers are busy




Pn = Steady state probability of having n customers in the system.

MARKOVIAN MODELS:

Birth and Death Queueing Models:

(i) (M|M|I): (  | FIFO)

(ii) (M|M|C): (  | FIFO)

(iii) (M|M|I): (K|FIFO)

(iv) (M|M|S): (K|FIFO)

Where M stands for Markovian Model

MODEL – I

Single Server Poisson Queue Model – I:

[M|M|I] : [  | FIFO]:

Let P0 and Pn be the values of the steady state probabilities for Poisson queue systems.


P0  1   


Where P0 is the probability of system being idle. (ie). No customers in the queue.

n

Pn    p0


(i) Average number Ls of customers in the system:

Let N denotes the number of customers in the queueing system. Then the values of N are 0,1,2,3,…..


Ls  E ( N )   npn
n 0

n


=  n   p0
n 0   

n


 
= n  1  
n 0     
n
   
= 1    n  
   n 0   

    
2 3
 
= 1   0   2    3    .....
       

      
2
   
= 1    1  2    3    ..... 
         

2
      
= 1   1  
  
    
1
    
=  1  
    
  ( ) 
 
=
 (1   ) 
  

  
= . 
    


Ls 
 

(ii) The average number Lq of customers in the queue or average length of the queue:

Let N denotes the number of customers in the queueing system. Then the number of customers
in the queue is (N-1).


Lq  E ( N  1)   (n  1) pn
n 1

n

  
=  (n  1)   1  
n 1   

    
= 1    (n  1) 1  
   n1  

      
2 3

= 1   0     2    .....
        

    
2
  
2

= 1    1  2    3    .....
        

2 2
       
= 1   1  
  
     
2 1
  
=  1  
  

 (  )2 
 
=
 (1   ) 
  
 2  2
= . 
 2     (   )

2
Lq 
 (   )

(iii) Average number Lw of customers in the non-empty queues:

Since the queue is non-empty, the number of customer in the system must be atleast 2, one
in the queue and one being served.

Lw = E {(N-1) |P (N-1) > 0}

E  N  1 E  N  1
 
P  N  1  0 P  N  1

LQ 2 1
  
P  N  1  (   ) 

P
n2
n

2 1

    

n
 
  
n2   
1   
 

2 1

       
n

     
1 
  n2  

2 1

 (   )         
2
 3

 
   
1   .....
      

2 1
=
 (   )     
2
      2 
1      1        .....
          

2 1

 (   )        
2 1

1       1   
    
 2 1 2 2
 
 (   ) 
   (   )  2
2


Lw 
 

(iv) The probability that the number of customers in the system exceeds K:

n

 
 
P( N  K )   Pn     1  
n  k 1 n  k 1     
n
   
 1     
   n k 1   

      
k 1 k 2 k 3
 
 1           .....
        

    
k 1
      2 
 1    1        .....
            

k 1 1
      
= 1    1  
      
k 1

P (N>K) =  


Little’s formula for (M|M|I):[  | FIFO) Model:


(i) E ( N S )    E (WS ) [ E ( N S )  LS ]
 

2
(ii) E ( N q )    E (Wq ) [ E ( N q )  Lq ]
 (   )

1
(iii) E (WS )  E (Wq ) 



(iv) E ( N S )  E (Wq ) 

 FORMULAS

1  = Mean arrival rate Average number of customers

arrivals per unit time
2  = Mean service rate per channel 1

E[T ]
3  = Traffic intensity or utilization factor  = 
4 Ls = Expected number of customers in the system  
Ls  
1   
5 Lq = Expected number of customer in the queue 2
Lq  Ls   
   
6 Ws = Expected time a customer spends in the system 1 1
Ws  Ls 
  
7 Wq = Expected waiting time per customer in the queue 1 
Wq  Lq 
  (   )
8 P0 = Probability of having zero customers in the system P0  1  
9 Pn = Steady state probability of having n customers in the Pn  1     n , n  0,1,2,....
system n

Pn    P0

10 N=Maximum number of customer permitted in the system N-1 = Number of customer in the
queue.
11 (i) P[ N  n] = Probability of queue length being greater P[ N  n]  n
than or equal to n.
(ii) P[ N  n] = Probability of queue length being greater P[ N  n]  n 1
than n.
12 P(w) = The probability density function of the waiting time
in the system. P(W )  (    )e (   ) w
13 P(Ws  t ) = The probability that the waiting time of a
customer in the system exceeds t. P (Ws  t )  e  (   )t
14 Lw = Average length of the non-empty queue. Queue formed
 1
from time to time. Lw  
 1 1  
15 P (Wq  t ) = The probability that the waiting time of a
  (   )
customer in the queue exceeds t. P (Wq  t )  e

16 n = Total number of customer in the system both waiting and
service.
Problems based on (M/M/1): ( / FIFO) Model:

1. Customers arrive at one-man barber shop according to a Poisson process with a mean inter arrival
of 12 min. Customers spend an average of 10 min. in the Barber’s chair.

(i) What is the expected number of customers in the barber shop and in the queue?

(ii) Calculate the percentage (%) of time an arrival can walk straight into the barber’s chair
without having to wait.

(iii) How much time can customer expect to spend in the barbers shop?

(iv) Management will provide another chair and here another barber, when a customer’s
waiting time in the shop exceeds 1.25h. How much must the average rate of arrivals
increase to warrant a second barber.

(v) What are the average time customers spends in the queue?

(vi) What is the probability that the waiting time in the system is greater than 30 min?

(vii) Calculate the percentage (%) of customers who have to wait prior to getting into the
barber’s chair.

(viii) What is the Probability that more than 3 customers are in the system?

Solution:

Given: One man barber shop  Single server.

Customers  infinite capacity.

 The given problem is (M/M/1): ( / FIFO) Model.

1
Given: Mean = = 12 minutes.


1
 Arrival rate =  = minutes.
12

1
And service rate =  = minutes.
10

(i)(a) To find the expected number of customers in the barber shop:


Ls 
 
 1 1
1 120
 12
= 12
= *
1
10  121 2
120 12 2

 Ls  5 Customers

(b) To find the expected number of customers in the queue:

2
Lq 
 (   )

 121 
2

=
10  10  12 
1 1 1

1
144
= 1
 
10 120
2

1
144
= 2
1200

1 1200
= *
144 2

 Lq  4.17  4 Customers

(ii) To Find P[A customer straightly go to the barber’s chair]:


P [No customer in the system] = P0  1 

1
P0 1  121
10

1 5 1
 1 *10  1  
12 6 6

1
P0 
6

1
 The Percentage of time an arrival need not wait = *100 16.67
6

(iii)To find a customer expected time to spend in the barber’s shop:

 1
Ws 
 

1 1 120
=  2 
1
10  12 120
1
2

Ws  60Min (or ) 1hr.

(iv) To find a customer’s waiting time in the shop exceeds 1.25 hrs:

Ws 1.25hrs

Ws  75 Min 1.25 hrs  75min

1
  75
 

1
  
75

1
  
75

1
  
75

1 1 1
    
75 10 75

13

150

Hence to warrant a second barber, the average arrival rate must increase by
13 1 1
  per min.
150 12 300

(v) To find the average time customers spend in the queue:


Wq 
 (   )


 121 
1
10  101  121 
 1
 12
1
10  1202 
Wq  50 min utes

(vi) To find the probability that the waiting time in the system is greater than 30 minutes
P Ws  t .

W.K.T P Ws  t   e(   )t

 10 12 
P Ws  30  e
1  1 30
 0.5
e

P Ws  30  0.6065

(vii) To Find P[a customer has to wait]:

P W  0 1 P W  0

1  1
1  P0  1   P0  6 
6

5
P W  0 
6

5
 The Percentage of customers who have to wait = *100  83.33
6

(vii) To find P [More than 3 customers in the system] ie. P  N  3 :

n 1

W.K.T P  N  n    

31
 1
4
1 
P  N  3   12    *10 
 10   12 

4
5
 
6

P  N  3  0.4823.
 2. Automatic car wash facility operates with only one bay cars arrive according to a Poisson
process, with mean of 4 cars per hour and may wait in the facility’s parking lot if the bay is busy.
If the service time for all cars is contact and equal to 10 minutes. Determine Ls , Lq , Ws and Wq

Solution:

Given: one bay  Single server

Cars  infinite capacity.

 The given problem is (M/M/1): ( / FIFO) Model.

Given: Mean arrival rate =  = 4 cars per hour.

Mean service rate =  = 6 cars per hour.

 1 
10 Min  10 *60  6 hrs 

(i)To find Ls :


Ls 
 

4 4
 
64 2

 Ls  2 cars

(ii) To find Lq :

2
Lq 
 (   )

(4)2 16 4
  
6  6  4  6*2 3

Lq 1.333 cars.

(iii) To find Ws :
 1 1 1
Ws   
  64 2
1
Ws  hours.
2

(iv) To find Wq :

 4 4 1
Wq    
 (    ) 6(6  4) 6* 2 3

1
 Wq  hours.
3

Hence,

(i) Ls  2 cars

(ii) Lq  1.333 cars.

1
(iii) Ws  hours
2

1
(iv) Wq  hours
3

3. Customers arrive at the first class ticket counter of a theatre at a rate of 12 per hour. There is one
clerk servicing the customer’s at the rate of 30 per hour.

(i) What is the probability that there is no customer at the counter?

(ii) What is the probability that there are more than 2 customers at the counter?

(iii) What is the probability that there is no customer waiting to be served?

(iv) What is the probability that a customer is being served and nobody is waiting?

(v) Probability that a customer has to wait for at most 4 minutes in the queue?

Solution:

Given: one clerk  Single server

Customers  infinite capacity.

 The given problem is (M/M/1): ( / FIFO) Model.

Given, Mean arrival rate =  = 12 per hour.

Mean service rate =  = 30 per hour.

(i)To find P [There is no customer at the counter]: P0

 12 18
P0 1  1  
 30 30
P0  0.6

(ii) To find P[There are more than 2 customers at the counter]: P  N  2

n 1

W.K.T P  N  n    

2 1 3
 12   12 
P  N  2     
 30   30 

 0.064

P  N  2  0.064.

(iii) To find P {There is no customer waiting to be served]:

P[There is at the most one customer in the counter] = P n1

   
= P(n=0) + P(n=1)  Pn  P0   
   

0 1
 
= P0    P0    P0  0.6
 

 12 
= (0.6)(1) + (0.6)  
 30 

= 0.6 + 0.24

P n1 = 0.84

(iv) P[A customer is being served and nobody is waiting]:

P[There is exactly one customer in the system who is being served]

 1
    12 
P1  P0       0.6    0.4  0.6 
    30 
P1  0.24

(v) To find P[n customer has to wait for at most 4 minutes in the queue]:

 1
P Wq  4 Min   P Wq  
 15 

 1
 1  P Wq  
 15 

  (   ) 1
1  e 15

12  (3012)151
1  e
30
18

1  (0.4)e 15

= 1 – 0.1205

P Wq  4 Min   0.8795

4. Customers arriving at a watch repair shop according to Poisson process at a rate of one per every
10 minutes and the service time is an exponential random variable with mean 8 minutes.

(i) Find the average number of customers Ls in the shop.

(ii) Find the average time a customer spends in the shop Ws

(iii) Find the average number of customer in the queue Lq

(iv) What is the probability that the server is idle?

Solution:

Given: Watch repair shop  Single server

Customer  Infinite Capacity.

 The given problem is (M|M|1) :(  | FIFO) Model:

 1
Given: Mean = = 10 min


1
 Arrival rate =  
10

1
And service rate =  
8

(i)To Find the average number of customers in the shop LS :


LS 
 
1
1 80
 10
 
1
8  101 10 2

LS = 4 customers.

(ii) To find the average time a customer spends in the shop WS :

1
WS 
 

1 80
   40
1
8  10 2
1

WS = 40 minutes.

(iii) To find the average number of customer in the queue Lq :

2
Lq 
 (   )

 101 
2
1
1 80
  100
  8
8 ( 8  10 ) 8  80
1 1 1 1 2
100 2

16

5

Lq = 3.2  3 customers
(iv) To Find the Probability that the server is idle: Po

 1
1 4
Po  1   1  101  1   8  1 
 8 10 5

1
Po 
5

5. Arrival at a telephone both are considered to be Poisson with an average time of 12 min between
one arrival and the next. The length of a Phone call is assumed to be distributed exponentially
with Mean 4 min.

(i) Find the average number of Persons waiting in the system.

(ii) What is the Probability that a person arriving at the booth will have to wait.

(iii) What is the Probability that it will take him more than 10 min altogether to wait for the
Phone and complete his call?

(iv) Estimate the fraction of the day when the Phone will be in use.

(v)The telephone department will install a second booth, when convinced that an arrival has to
wait on the average for atleast 3 min for Phone. By how much the flow of arrivals should increase
in order to justify a second booth?

(vi) What is the average length of the Non-empty queue that Forms from time to time?

Solution:

Given: Telephone booth  Single server.

Customer s  Infinite Capacity.

 The given problem is (M|M|1) :(  | FIFO) Model:

1
Given: Mean = = 12 min


1
 Arrival rate =  
12

1
And service rate =  
4

(i)To Find the average number of Persons in the system: LS

 
LS 
 
1
1 48 1
 12
  
1
4  1
12 12 8 2

1
LS 
2

(ii) To Find P[The Person arriving in the booth has to wait]: P[N > 0]

P[N > 0] = 1 – P[n = 0]

= 1 – P[no customer in the system]

= 1 - P0

  1
 1  1   1  1  121
  4

1
P[N > 0] =
3

(iii) To Find A Person takes more than 10 min to wait and complete his call ie., P[w > 10]:

W.K.T. P  w  t   e(   )t

 14  12 
P  w  10  e
1 10
 53
e

P[w  10]  0.1889

(iv) To Find P [The Phone will be in use]:

P[Phone in use] = P[Phone in busy]

= 1 – P[Phone in idle]

   121
= 1 - P0  1  1     1
 
1 1
  4

1
P[Phone in use] =
3

(v) To Find the second Phone will be installed, if an arrival has to wait on the average for at least 3 min
for Phone: [ Wq >3].
 Wq > 3


 3
 (   )

   3   (   ) 

  3 2  3

  3  3 2

2
1 1
  3    3 
4  4  

3  1
      3 
 
4 16  

7 3

4 16

3
7 
4

3

28

Hence the arrival rate should increase by,

3 1 1
  Per min
28 12 42

(vi) To Find the average length of the Non-empty queue: Lw


Lw 
 
1
1 48
 4
 
1
4  1
12 4 8

3
Lw 
2
 6. In a railway Marshalling yard, goods trains arrive at a rate of 30 trains per day. Assuming that the
inter – arrival time follows an exponential distribution and the service time distribution is also
exponential with an average 36 minutes. Calculate the following

(i) The Mean size queue.

(ii) The Probability that the queue size exceeds 10.

(iii) If the input of trains increases to an average of 33 Per day what will be change in the above

quantities?

Solution:

Given: A railway Marshalling yard  Single server

good trains  Infinite Capacity.

 The given problem is (M|M|1):(  | FIFO) Model:

Given: Mean arrival rate =  = 30 trains per day.

Mean service time = 36 minutes.

(24)(60)
Mean service rate =    40 trains per day
36

(i)To find the Mean queue size: Lq

2
Lq 
 (   )

 30 
2
900 900
  
40  40  30  40 10 400

9

4

Lq = 2.25  2 trains.

(ii) To Find P[The queue size exceeds 10] (or) P  N  10 :

n

W.K.T. P  N  n   

 10 10
 30   3
P  N 10      
 40  4

P  N  10  0.056

(iii) To Find if the input of trains increases to an average of 33 per day.

Here,   33,   40.

(a)To Find Mean queue size:

2
Lq 
 (   )

 33
2
1089 900
  
40  40  33 40  7 280

 3.889

Lq = 4 trains.

 Change in queue size = 3.889 – 2.25 = 1.64

 2 trains.

(b) To Find P[The queue size exceeds 10]

ie., P  N  10

10
 33 
P  N  10    
 40 

P  N  10 = 0.146

 Change in Probability = 0.146 – 0.056 = 0.09.

MODEL – II

Multi server Poisson Queue Model – II [M|M|1]:[  | FIFO]

(i)The value of P0 and Pn :

 The Probability of zero customers in the system P0

1
P0  n c
c 1
1    1     c 
    c !     c   
n 0 n !       

Where P0 is idle.

The Probability of Poisson Queue system Pn is,

 1   n
   P0 If 0  n  c
 n!   
Pn   n
 1 
 c !c n c    P0 If n  c
  

(ii) The average number of customers in the queue: Lq

c 1
1  1
Lq    P0
c !c      
2

1  c 
 

Where C is Multi server or Number of server

(iii) The Average number of customers in the system LS


LS  Lq 

c 1
1  1 
Ls    P0 
c !c      
2

1  c 
 

(iv) The Average time a customer has to spend in the system Ws :

1
Ws  Ls

 c 1
1 1  1 
Ws  P0 
 c !c      
2

1  c 
 

(v) The average time a customer has to spend in the queue Wq :

1
Wq  Lq

c 1
1 1  1
Wq 
 c !c    2
P0
  
1  c 
 

(vi) The Probability that an arrival has to wait (or) The Probability that there are C or more customers in
the system.
c


P( N  c)    P0  P(Ws  0)  P( N  c)
  
c !1  
 c 

(vii) ) The Probability that an arrival has to get the service without waiting:

P(Getting the service without waiting) = P(System is idle)

= 1 – P(Arrival has to wait)

c


 1   P0
  
c ! 1  
 c 

(viii) The Probability that someone will be waiting:

c 1


P( N  c)    P0
  
c ! c 1  
 c 

(ix) The Mean waiting time in the queue for those who actually wait E Wq | Ws  0  
 E Wq | Ws  0  
1
c  

(x) The Average number of customers (in non-empty queues) who have to actually wait:


Lw 
c  


(xi) Traffic intensity (or) utilization factor =   .
c

Problem based on (M|M|C) :(  | FIFO) Model:

1. There are 3 typists in an office. Each typist can type an average of 6 letters per hour. If letters arrive for
being typed at the rate of 15 letters per hour.

(i) What fraction of the time all the typists will be busy?

(ii) What is the average number of letters waiting to be typed?

(iii) What is the average time a letter has to spend for waiting and for being typed?

(iv) What is the Probability that a letter will take longer than 20 min waiting to be typed and being

Typed?

Solution:

Given: 3 Typists  Multi server

Number of letters  Infinite Capacity.

 The given problem is (M|M|C) :(  | FIFO) Model:

Given: Arrival rate =  = 15 per hour

Service rate =  = 6 per hour

Number of server = C = 3.

To Find P0 :

1
P0  n c
c 1
1    1     c 
    c !     c   
n 0 n !       
 1

1  5  1  5   3 6 
31 n 3

      
n 0 n !  2 

3!  2   3  6  15 

1
 n
2
1 5 1  125  18 
 n!  2 
n 0
   
6  8  18  15 

1
 n
2
1 5 1  125  18 
 n!  2 
n 0
   
6  8  3 

1
 n
2
1  5   125 
   
n 0 n !  2 

 8 

1

 1  5  1  5  1  5  2  125  
0 1

          
 0!  2  1!  2  2!  2   8  

1 1
 
5 25 125 8  20  25  125
1  
2 8 8 8

8

178

 P0  0.0449

(i)To Find P[All typists are busy]

ie., P  N  3 :

c


W.K.T. P ( N  c ) 
  P0
  
c !1  
 c 
 3
 15 
 
P( N  3)  6 (0.0499)
 15 
3!1  
 3 6 

 125 
 
 
8 
(0.0499)
 15 
6 1  
 18 

 125 
 
  8 
(0.0499)
 3
6 
 18 

 P  N  3  0.7016

(ii) The average number of letters waiting to be typed:

c 1
1  1
Lq    P0
c !c      
2

1  c 
 
31
1  15  1
   (0.0499)
3!3  6   15 
2

1  
 3 6 
4
1  15  1
   (0.0499)
6  3  6   18  15 2
 
 18 

1  625  324
    (0.0499)
18  16  9

9092.25

2592

 Lq  3.5078

(iii) To find the average time a letter has to spend for waiting: Ws
 1
Ws  Ls



W.K.T. LS  Lq 


15
 3.5078 
6

Ls  6.0078

1 1
Ws  Ls  (6.0078)
 

1
 (6.0078)  0.4005 hours.
15

 0.4005  60 min utes

 Ws  24.03  24 minutes.

(iv) To find the probability that a letter will take longer than 20 min. waiting to be typed:

W.K.T

 
c

  1  e 
  t ( c 1  /  )
 
 
P w  t  e  t 1   
u
P0 
 c !1     c  1   /   
  c  
 

 
 20   1 6
1 
 (2.5) (1  e
3 2( 0.5)
) 

P w    P w    e 3
1   0.0449
 60   3  6 1  2.5   0.5 

  3  


 1
P  w    0.4616
 3

2. A Supermarket has two girls attending to sales at the counters. If the service time for each customer is
exponential with Mean 4 minutes and if people arrive in a Poisson fashion at the rate of 10 per hour

(i) What is the probability of having to wait for service?

(ii) What is the expected percentage of idle time for each girl?
(iii) Find the average queue length and the average number of units in the system?
 (iv) If a customer has to wait, what is the expected length of his waiting time?

Solution:

Given : Two girls  multi server

Customer  Infinite capacity

 The given problem is (M|M|C): ( | FIFO) model:

Given: Arrival rate =  = 10 per hour

1
Service time = = 4 minutes


60
Service rate =  = = 15 per hour
4

Number of server = C = 2.

To Find P0 :

1
P0  n C
c 1
1  1     C 
  
n 0 n !   
   
C !     C    

1

1  10   2 15 
2 1 n 2
1  10 
      
n  0 n !  15  2!  15   2(15)  10 

1
 n 2
1
1  10  1  10   30 
       
n  0 n !  15  2  15   20 

1
 0 1 2
1 2 12 12 3
         
0!  3  1!  3  2  3   2 

1

2 1 4 3
1   
3 2 9 2
 1 1
= 
2 1 3  2 1
1 
3 3 3

1 3 1
  
6/3 6 2

1
 P0 
2

(i) To find P[A customer having to wait]:

P[N  2]:
c


W.K.T P[N  C]    P0
  
C ! 1  
 C 
2 2
 10   1  2 1
       
        
15 2 3 2
 10   20 
2!1   2 
 2 15   30 

4 1 3
=  
9 4 2

1
 PN  C 
6

(ii) To find expected percentage of idle time for each girl:


Fraction of time that a girl is busy =  
C

10 1
 
25 3

1
 
3

1
Fraction of time when a girl is idle = P0  1    1 
3
 2
 P0 
3

2
 Percentage of idle time for each girl = 100  67%
3

(iii) (a) To find average queue length in the system:

Lq

c 1
1  1
Lq    P0
C !C      
2

1  C 
 
2 1
1  10  1 1
    
2!2  15   10   2 
2

1  
 2 15 
3
12 1 1
    
4  3   20 2  2 
 
 30 

 1  2  1   1  1  1
=         
 4  3  2   4  3  12

1
 Lq 
12

(b) To find average number of units in the system: Ls


Ls  Lq 


1 10 15  120 135
=   
12 15 12 15 12 15

3
 Ls 
4

(iv) To find the expected length of his waiting time: E (Wq | Ws  0) :

 1
E (Wq | Ws  0) 
C  

1 1
  hour
2 15  10 20

1
=  60 Minutes
20

E (Wq | Ws  0) = 3 minutes

3. A petrol pump station has 4 pumps. The service time follows the exponential distribution with a mean
of 6 min and cars arrive for service in a Poisson process at the rate of 30 cars per hour.

(i) What is the probability that an arrival would have to wait in line?
(ii) Find the average waiting time in the queue, average time spends in the system and the
average number of cars in the system.
(iii) For what percentage of time would a pump be, idle on an average?

Solution:

Arrival rate =  = 30 per hour

1
Service time = = 6 minutes


60
Service rate =  = = 10 per hour
6

Number of server = C = 4.

To find P0 :

1
P0  n C
c 1
1  1     C 
  
n 0 n !   
   
C !     C    

1

1  30   4 10 
41 n 4
1  30 
      
n 0 n !  10 

4!  10   4 10  30 
 1

 3   3  
3
1 1 4 40

n

n 0 n ! 4!  10 

1

1 1 1 1 1 1
 3   3   3   3   3  4
0 2 3 4

0! 1! 2! 3! 24

1
=
9 1 1
1  3   (3)3  (3)4
2 6 6

2
 P0 
53

(i) To find P[an arrival would have to wait in line]

c


PN  C    P0
  
C !1  
 C 
4
 30 
 
 10   2

 30   53 
4!1  
 10  4 
 3
4
2

 10  53
24  
 40 
(3)3
=
53
= 0.5094.
(ii) (a) To find the average waiting time in the queue: Wq :

c 1
1 1  1
Wq    P0
C ! C      
2

1  C 
 
 4 1
1 1  30  1  2 
    
4! 30  4  10   30   53 
2

1  4(10) 
 
1 1 1  2
 (3)5  2  
24 120  1   53 
 
4
Wq = 0.0509 hours

 Wq  3.05 min utes

(b) To find average time spends in the system: Ws

c 1
1 1  1 1
Ws  P0 
 C !C      
2

1  C  
 
5
1 1  30  1 2 1
   ( )
30 4!4  10   2
30  53 10
 1  4(10) 
 
1 1 1 2 1
  3 ( )
5
2
30 24(4)  1  53 10
 
4
=0.1509 hours

Ws  9.05 Minutes

c) To find the average number of cars in the system: Ls

c 1
1  1 
Ls    P0 
C !C      
2

1  C  
 
5
1  30  1  2  30
   2  
4!4  10   30   53  10
 1  4(10) 
 
 1 1 2 30
  3 ( )
5
2
24(4)  1  53 10
 
4

= 4.5283 cars

Ls = 4.5283 cars

(iii) To find the percentage of time a pump is idle:

 30
P(A pump is idle) = 1   1
C 4(10)
3 1
=1  
4 4

 Percentage of time a pump is idle

1
 100  25%
4

Model-III

Single server, Finite capacity Poisson Queue Model-III:

(M|M|l) : (K/FIFO)

(i) The value of P0 and P n :

The probability of Zero customer in the system P0 is,

 
 1 
 k 1
If   
 
P0  1   
 
 1
 If   
 k 1

Where P0 is idle.

The probability of Poisson queue system Pn is

    
 n 1 
     
If   
    k 1 
Pn     1     
   
   

 1 If   
 k  1

(ii) The effective arrival rate : 

 '   (1  P0 )

(iii) P[A customer turned away]: Pk

k

Pk    P0

(iv) The Average number of customers in the system: Ls
    
k 1

     k  1   
       If   
   k 1 
LS  1   
 1    
   



k If   
 2
(v) The Average number of customers in the queue : Lq
'
Lq  Ls 

(vi) The average time a customer has to spend in the system : Ws
Ls
Ws 
'
(vii) The average time a customer has to spend in the queue : Wq
Lq
Wq 
'
(viii) Traffic intensity (or) Utilization factor:



Problems based on (M|M|l) : (K|FIFO) Model:

1. Patients arrive at a clinic according to Poisson distribution at a rate of 30 patients per hour. The
waiting room does not accommodate more than 14 patients. Examination time per patient is
exponential with mean rate of 20 per hour.
(i) Find the effective arrival rate at the clinic.
(ii) What is the probability that an arriving patient will not wait?
(iii) What is the expected waiting time until a patient is discharged from the clinic?

Solution:

Given : A clinic  Single server.

Patient  finite capacity

The given problem is (M|M|l) : (K|FIFO) Model:

Given : Arrival rate =  = 30 per hour     

Service rate =  = 20 per hour

Finite capacity = k = capacity of the system

= [14 waiting patients + 1patient in service]

= 14 + 1

k  15

To find P0 :


1

P0     
   k 1 
1    
  
 

30
1
20 1 3 / 2
 
  30  151
3
1/6

1     1   
  20   2

0.5
=  0.00076
655.84
 P0  0.00076

(i) To find the effective arrival rate at the clinic:

The effective arrival rate =  '   (1  P0 )

= 20(1-0.00076)

=20(0.99924)

=19.98

 '  20 Per hour

(ii) To find P(A patient will not wait):
P0  0.00076
(iii) To find the expected waiting time until a patient is discharged: Ws 
Ls
Ws 
'

To find Ls :

k 1
 
(k  1)  
W.K.T . Ls 

 
 
k 1
1 1  


15 1
30  30 
(15  1)  
 20   20 
15 1
30  30 
1 1  
20  20 
16
3 3
  16  
      16  3  16.02
2 2
 1  3
  1  
 2  2

Ls  13.02

Ls
 Expected waiting time  Ws 
'
 13.02

20

= 0.651 hours

= 0.651 x 60 minutes

= 39.06 Minutes

Ws  39 Minutes

2. At a railway station only one train is handled at a time. The railway yard is sufficient only for 2
trains to wait, while the other is given signal to leave the station. Trains arrive at the station at an
average rate of 6 per hour and the railway station can handle them on an average of 6 per hour.
Assuming Poisson arrivals and Exponential service distribution find the probabilities for the
numbers of trains in the system. Also find the average waiting time of a new train coming into the
yard. If the handling rate is doubled, how will the above results are modified?

Solution:

Given: A railway station  Single server

Train  Finite capacity

 The given problem is (M|M|l) : (K|FIFO) model :

Given : Arrival rate =  = 6 per hour [    ]

Service rate =  = 6 per hour

Finite capacity = k = 3 ( 2 trains + 1 train = 3 trains)

To find P0 :

1
P0  [   ]
K 1

1
P0 
4

1 1
P0   for n  1, 2,3..
K 1 4

(i) To find P [The numbers of trains in the system] Ls

K
Ls  [    ]
2
 3
Ls   1.5
2

(ii) To find the average waiting time in the station of a new train coming in to the yard:

Ls
Ws 
'

To find  ' :

 1 3
 '   (1  P0 )  6 1    6  
4  4   

 '  4.5

Ls 1.5 1 1
Ws    hours  *60 min utes
 '
4.5 3 3

Ws  20 min utes

(iii) To find if the handling rate is doubled:

i.e., Service rate is doubled =   2  6  12

To find P0 :


1

P0  K 1
(   )

1  


6
1
P0  12  1 2
31
 6 15 16
1  
 12 

8
 P0 
15


 P0      
6 8
 Pn 
  12   15 
 n
1  8 
Pn      , n  1, 2,3..
 2   15 
1
1  8  4
For n=1, P1     
 2   15  15
2
1  8  2
For n=2, P2     
 2   15  15
3
1  8  1
For n=3, P3      
 2   15  15

(a) To find Ls :

      K  1   
K 1

Ls 
1    1   
K 1

 6 12    3  1 6 12 
31

Ls   1  0.2667
1   6 12  1   6 12 
31

 Ls  0.7333train.

(b) To find Ws :

Ls
Ws 
'

To find  ' :

 '   (1  P0 )

 8
=12 1  
 15 

 '  5.6 per hour

Ls 0.7333
Ws    0.131 hour
 '
5.6

=0.131x60 minutes

=7.86 minutes
 Ws  7.9minutes

MODEL-IV

Multiserver, Finite capacity Poisson queue model-IV

(M|M|C): (K|FIFO)

(i) The values of P0 and P n :

The probability of zero customers in the system P0 is

1
P0  n C n C
C 1
1  1 K
  
    c!  
n 0 n !     
  
n C   C 

The Probability of Poisson Queue system P n is:

 1   n
   P0 for n  C
 n!   
 n
 1 
 Pn   n C   P0 for C  n  K
 C !C   
0 for n  K




(ii) The average queue length or average number of customers in the queue:


C
 C     K C      
K C

Lq  P0   2 
1     K  C  1    
      C   C  C  
C !1  
 C 

(iii) The average number of customers in the system:

'
Ls  Lq 


(iv) The average number of waiting time in the system:

1
Ws  Ls
'
 (v)The average number of waiting time in the queue:

1
Wq  Lq
'

(vi)The effective arrival rate:  '

C 1
 '  [C   (C  n) P0 ]
n0

(vii) Traffic intensity (or) Utilization factor:


 =
C

Problems based on (M|M|C) : (K|FIFO) model:

1. A 2 person barber shop has 5 chairs to accommodate waiting customers. Potential customers, who
arrive when all 5 chairs are full leave without entering barber shop. Customers arrive at the
average rate of 4 per hour and spend on average of 12min in the barber’s chair compute
P0 , P1 , P7 , Lq and Ws

Solution:

Given: Two person barber shop  Multiserver

Five chair  finite capacity

 The given problem is (M|M|C): (K|FIFO) model:

Given: Arrival rate=   4 per hour

1
Inter-service rate= =12 min


1 1 1
  12 x 
 60 5

 Service rate=  =5 per hour

Finite capacity =K=Capacity of the system

 K  5 2
 K=7

Number of servers=C=2
C  2

(i) To find P0

1
P0  n C n C
C 1
1  1 K
  
    c!  
n 0 n !     
  
n C   C 

1
= n 2 n2
2 1
1 4 1 4 7
 4 
     
n 0 n !  5  2!  5 
  
n2  2  5 

1
= n n2
1
1 4 1  16  7  4 
  
n 0 n !  5 
    
2!  25  n 2  10 

1
=
 1  4  1  4   8  2   2 1  2  2  2 3  2  4  2 5 
0 1 0

                         
 0!  5  1!  5   25  5   5   5   5   5   5  

1
=
 4  8   2   4   8   16   32  
1    1           
 5  25   5   25   125   625   3125  

1
=
9 8
   (1.65984)
 5  25

1 1
= =
9 13.27872 45  13.27872

5 25 25

25
=  0.429
58.27872

 P0  0.429

(ii) To find P1 :

n
1 
W.K.T Pn    P0 for n  C
n!   
 1
14
Put n = 1, P1    (0.429) [1  2]
1!  5 

4
=   (0.429)
5

P1  0.3432

(iii) To find P7 :

n
1 
W.K.T Pn    P0 for C  n  K
C !C n C 
7
1 4
Put n=7, P7    (0.429)
2!27 2  5 

7
1 4
=   (0.429)
2(25 )  5 

 P7  0.0014

(iv) To find Lq :


C
 C     K C      
K C

W.K.T Lq  P0   2 
1     K  C  1    
      C   C  C  
C !1  
 C 

4
2
4 5 2   4 7  2  4  4  
72

 (0.429)   2 
1      7  2  1    
5  4    5  2   5  2  5  2  
2!1  
 5 2 

 16  4 10   2 5  2  2  
5

 (0.429)   1      5  1    
 25     5   5  5  
2
4
2 1  
 10 

 16  2 5   32   480  
 (0.429)   1     
 25  2  9    3125   15625  
 
 25 

= (0.429)(0.64)(0.5556)[1-0.0102-0.030]
 =0.1463

 Lq  0.15 customer

(v) To find Ws :

1
Ws  Ls
'

To find  ' :

C 1
 '  [C   (C  n) Pn ]
n0

2 1
 5[2   (2  n) Pn ]
n0

1
 5[2   (2  n) Pn ]
n0

 5[2  (2(0.429)  (0.3432)]

 '  3.994

To find Ls :

'
Ls  Lq 


3.994
 0.15   0.9488
5

 Ls  0.95 customer

1 1
Ws  Ls  0.95
 '
3.994

=0.2376 hours

=0.2376 60 min utes

Ws  14.256 min utes

 2. A car servicing station has 2 bays where service can be offered simultaneously. Because of space
limitations. Only 4 cars are accepted for servicing. The arrival pattern is Poisson with 12 cars per
day. The service time in both the bays is exponentially distributed with   8 cars per day. Find
the average number of cars in the service station, the average number of cars-waiting for service
and the average time a car spends in the system.

Solution:

Given: Two bays  Multiserver

Four cars  finite capacity

 The given problem is (M|M|C): (K|FIFO) model:

Given: Arrival rate=   12 per day

 Service rate=  =8 per day

Finite capacity =K=Capacity of the system

 K=4
Number of servers=C=2

C  2

(vi) To find P0

1
P0  n C n C
C 1
1  1 K
  
    c!  
n 0 n !     
  
n C   C 

1
= n 2 n2
2 1
1  12  1  12  4
 12 
     
n 0 n !  8  2!  8 
  
n2  8  2 

1
= n n2
1
1 3 19 4 3
       
n 0 n !  2  2  4  n2  4 

1
=
 1  3  1  3   9  3  0  3 1  3  2 
0 1

                
 0!  2  1!  2   8  4   4   4  
 1
=
 3  9   3   9 
1    1       
 2  8   4   16  

1
=
 5  9  37 
   
 2  8  16 

1 1
= 
2.5  1.125(2.3125) 5.10156

 P0  0.1960

(ii) To find the average number of cars waiting for service in the queue Lq :


C
 C     K C      
K C

W.K.T Lq  P0   2 
1     K  C  1    
      C   C  C  
C !1  
 C 

 12 
2
12 8  2   12 42  12  12  
42

 (0.1960)   2 
1      4  2  1    
8  12    8  2   8  2  8  2  
2!1  
 8 2 

3 4  3  1  3  
2 2 2
3
 (0.1960)   2 
1      2     
2  1    4   4  4  
2 
4

 9  3 4   9   9 
 (0.1960)   1       
 4  2  1    16   32  
 
 16 

= (0.1960) (2.25)(6)[1-0.5625-0.28125]

= 2.646  0.15625

= 0.4134

 Lq  0.4134

(iii) To find the average number of cars in the service station: Ls :

 '
Ls  Lq 


To find  :
'

C 1
 '  [C   (C  n) P0 ]
n0

2 1
 8[2   (2  n) Pn ]
n 0

1
 8[2   (2  n) Pn ]
n 0

=8[2-(2 P0 +1. P1 )]

 8[2  (2  0.1960  0.294)]

=8(1.314).

 '  10.512

'
Ls  Lq 


10.512
 0.4134   0.4134  1.314
8

 Ls  1.7274  1.73

(iv) To find the average time a car spend in the system Ws :

1
Ws  Ls
'

1.7274
  0.1643 day
10.512

=0.1643 24 hours

Ws  3.94 hours