Prob. 1.

A Rail company has a large fleet of locomotives. They become due for major overhaul in a Poisson process
and are then sent to a workshop. On average, one locomotive arrives every 18 days. At present the
locomotives join a single queue for overhaul and are eventually serviced by single team of mechanics. The
overhaul time distribution for engines is exponential with a mean of 16 days.

a) What is the average number of locomotives in the workshop?

b) What is the average time a locomotive will be in the workshop before it starts operating again?
c) What is the probability that a locomotive arriving at the workshop would be taken immediately for
overhauling?
 Relationships among L, W, Lq and Wq
(Applicable to all single server queues)
• L = W Little’s Formula
• Why?
• Consider a duration of one hour.
• What is the average total waiting time incurred in this one hour?
• On the average there are L customers in the system.
• How many arrivals (average) in one hour?
• What is average waiting for each arrival?
L = W Lq = Wq
If one is known, others
W = Wq + 1/ Lq = L-(1-P0) can be computed.
 Multiple Server Case : M/M/s// 

      

0 1 2 ……. s s+1 s+2 s+3 …….

 2 3 s s s s
       
P0 = P1
…….
0 1 2 s s+1 s+2 s+3 P0 + 2P2 = (P1

 2 3 s s s s P1+3P3 = (+2)P2
1
P0 
 s-1 λ /μ n λ /μ s 1  P0 λ /μ sρ λ
   Lq  ρ
n 0 n! s! 1  λ /sμ   s!1  ρ 2 sμ

 λ /μ n
 P0, if 0  n  s Wq = Lq/ W = Wq+1/
Pn   n!
 λ /μ n
 n s P0 , if n  s
 s!s L = Lq+/
 Limited Waiting Space: M/M/1/K/

   
 1 ρ   1 ρ  n
P0    Pn   ρ
K 1 1 ρ K 1 
1 ρ 
0 1 2 ……. K
ρ K  1ρ K 1 Lq = L- (1-P0)
L -
1 -ρ 1  ρ K 1
   
 Is Little’s Formula Applicable for M/M/1/K model?
• W = L/ Wq = Lq/ 
• Formula assumes that  is constant.
• It is true in this case?
• What about n=K? What is the arrival rate?
• Can we still use the formula?
• Compute average arrival rate 
•  = (1-Pk) + Pk.0  = (1-Pk)
 Limited Waiting Space (Multiserver): M/M/s/K/
 λ /μ n
 P0 for n  1,2,...., s
 s-1 n s   n!
λ /μ   λ /μ 
n s K  λ /μ n
P0  1/    λ /sμ   Pn   P
n s 0
for n  s, s  1,..., K
n 1 n! s! n s 1   s!s
  0 for n  K



Lq 
P0 (λ /μ )sρ
s!(1  ρ ) 2
1 ρ K s
 (K  s)ρ K s 
1  ρ 
s 1  s 1 
L   nPn  Lq  s1   Pn 
n 0  n 0 
 Limited Calling Population: M/M/1//N
 is arrival rate for each unit of population
Arrival rate of entire population: N
Is this arrival rate constant?
NO. Why? 
N (N-1) (N-2)

0 1 2 ……. N

   
 M/M/1//N Formulas

 N  N! 
P0  1 /     /  n  Pn 
N!
 /  n P0
n 0  ( N  n)!
( N  n)!


 
Lq  N  (1  P0 ) LN (1  P0 )
 

W  L/ Wq  Lq /     ( N  L)
 M/G/1 Queuing Model
• Is Exponential Distribution realistic for
modeling service time? Why or Why not?
• Analysis difficult with non-exponential
distribution.
• Assumption of memorilessness is violated.
• Birth and Death Process does not apply.
 M/G/1 Formulas
Service time has mean 1/ and variance 2

P0 = 1- 2 2   2 L =  + Lq
Lq 
21   

Wq = Lq/ W = Wq + 1/

Note: Queue length and waiting time increase as variance

increases, even though the mean is unchanged.
Distribution of states and waiting time not available.
 M/G/1 and M/G/s
M/G/1 : No formula available for Pn
Not possible to compute distribution of waiting time.

M/G/s : No results available for general case

Some results are available when service time:
- is constant (M/D/s)
- follows Erlang distribution (M/Ek/s)
A machine shop has three machines that keep failing once every 20
minutes on average with an exponential failure time. There are two
repairmen available to repair the failed machines, each one taking
on average 15 minutes to repair the machine, again with an
exponential repair time. Draw the transition rate diagram of the
birth and death process for this system, and write the rate
equations for states 0 and 1. Use one hour as the unit of time for
expressing all transition rates.

For the above system, the probabilities of states 0,1,2 and 3 are
0.18, 0.4, 0.3 and 0.12, respectively. Calculate the average number
of arrivals per hour (  ) for this queuing system.