Queuing Systems

See Definition of Queuing Theory

 General Structure

• Arrival Process
• According to source
• According to numbers
• According to time
• Service System
• Single server facility
• Multiple, parallel facilities with single queue
• Multiple, parallel facilities with multiple queues
• Service facilities in a parallel

C.R.Krishna Prasad, BIT Bangalore-4

• Queue Structure
• First come first served
• Last come first served
• Service in random order
• Priority service

C.R.Krishna Prasad, BIT Bangalore-4

• Model 1: Poisson-exponential
single server model – infinite
population
Assumptions:
 Arrivals are Poisson with a mean arrival rate of, say
λ
 Service time is exponential, rate being μ
 Source population is infinite
 Customer service on first come first served basis
 Single service station
For the system to be workable, λ ≤ μ
C.R.Krishna Prasad, BIT Bangalore-4
• Model 2: Poisson-exponential
single server model – finite
population
Has same assumptions as model 1,
except that population is finite

C.R.Krishna Prasad, BIT Bangalore-4

• Model 3: Poisson-exponential multiple
server model – infinite population
Assumptions
 Arrival of customers follows Poisson law, mean rate λ
 Service time has exponential distribution, mean
service rate μ
 There are K service stations
 A single waiting line is formed
 Source population is infinite
 Service on a first-come-first-served basis
 Arrival rate is smaller than combined service rate of
all service facilities

C.R.Krishna Prasad, BIT Bangalore-4

 Model: 1Operating Characteristics

a) Queue length
 average number of customers in queue waiting to get
service
b) System length
 average number of customers in the system
c) Waiting time in queue
 average waiting time of a customer to get service
d) Total time in system
 average time a customer spends in the system
e) Server idle time
 relative frequency with which system is idle

C.R.Krishna Prasad, BIT Bangalore-4

• Measurement parameters
• λ= mean number of arrivals per time period (eg.
Per hour)
• μ = mean number of customers served per time period
• Probability of system being busy/traffic intensity
ρ= λ/μ
• Average waiting time system Ws = 1/(μ- λ)
• Average waiting time in queue
Wq= λ/ μ(μ- λ)
• Average number of customers in the system
Ls = λ/ (μ- λ)

C.R.Krishna Prasad, BIT Bangalore-4

• Average number of customers in the queue
Lq = λ2/ μ(μ- λ)
• Probability of an empty facility/system being idle
P(0) = 1– P(w)
• Probability of being in the system longer than
time (t)
P(T>t)= e –(μ- λ)t
Probability of customers not exceeding k in the
system
P (n.≥k) = ρk
P( n>k) = ρ(k+1)
Probability of exactly N customers in the system
P(N) = ρN (1-ρ)

C.R.Krishna Prasad, BIT Bangalore-4

• Problem : At a service counter of fast-food
joint, the customers arrive at the average
interval of six minutes whereas the
counter clerk takes on an average 5
minutes for preparation of bill and
delivery of the item. Calculate the
following
a. counter utilisation level
b. average waiting time of the customers at
the fast food joint
c. Expected average waiting time in the line
C.R.Krishna Prasad, BIT Bangalore-4
d. Average number of customers in the service
counter area
e. average number of customer in the line
f. probability that the counter clerk is idle
g. Probability of finding the clerk busy
h. chances that customer is required to wait
more than 30 minutes in the system
i. probability of having four customer in the
system
J) probability of finding more than 3 customer in
the system
C.R.Krishna Prasad, BIT Bangalore-4
• Solutions: Given λ = 60/10 = 10 customer/hr

• μ = 12 customer/hr
• A) traffic intensity ρ = λ / μ = 10/12 = 0.833
• b) waiting time in the system
Ws = 1/ μ- λ = 1/12-10 = 0.5 hr
• C) waiting time in the queue
Wq = λ/ μ (μ- λ) = 10/12(12-10) = 0.416 hr
• D) number of customer in the system
Ls= λ/ (μ- λ) = 10/12-10 = 5 customers
• E) Number of customer in the queue
• Lq = λ2 / μ (μ- λ) = 102 /12(12-10) = 4.167 customers

C.R.Krishna Prasad, BIT Bangalore-4

f) probability that the counter clerk is idle
1- ρ = 1- λ / μ = 1- 10/12 = 0.167
g. Probability of finding the clerk busy
ρ = λ / μ = 10/12 = 0.833
h) chances of probability that customer
wait more than 30min = 30/60 = 0.5
hrs
• P (T>t) = e – (μ- λ) t
• P (T>0.5) = e – (12- 10) 0.5 = 0.368
C.R.Krishna Prasad, BIT Bangalore-4
I) probability of having four customer in the
system
P (N) = ρN (1-ρ)
P (4) = ρ4 (1-ρ) = (0.833)4(1-0.833) =
0.0806
j) probability of finding more than 3 customer in
the system
P (n>k) = ρ (k+1)
P (n>3) = ρ (3+1) = (λ / μ) 4= (10/12) 4
= 0.474
C.R.Krishna Prasad, BIT Bangalore-4
 Model: 1Operating Characteristics

a) Queue length
 average number of customers in queue waiting to get
service
b) System length
 average number of customers in the system
c) Waiting time in queue
 average waiting time of a customer to get service
d) Total time in system
 average time a customer spends in the system
e) Server idle time
 relative frequency with which system is idle

C.R.Krishna Prasad, BIT Bangalore-4

• Measurement parameters
• λ= mean number of arrivals per time period (eg.
Per hour)
• μ = mean number of customers served per time period
• Probability of system being busy/traffic intensity
ρ= λ/μ
• Average waiting time system Ws = 1/(μ- λ)
• Average waiting time in queue
Wq= λ/ μ(μ- λ)
• Average number of customers in the system
Ls = λ/ (μ- λ)

C.R.Krishna Prasad, BIT Bangalore-4

• Average number of customers in the queue
Lq = λ2/ μ(μ- λ)
• Probability of an empty facility/system being idle
P(0) = 1– P(w)
• Probability of being in the system longer than time (t)
P(T>t)= e –(μ- λ)t
Probability of customers not exceeding k in the system
P (n.≥k) = ρk
P( n>k) = ρ(k+1)
Probability of exactly N customers in the system
P(N) = ρN (1-ρ)

C.R.Krishna Prasad, BIT Bangalore-4

• Problem 1. Customers arrive at a
booking office window, being
manned by a single individual a a
rate of 25per hour. Time required to
serve a customer has exponential
distribution with a mean of 120
seconds. Find the mean waiting time
of a customer in the queue.

C.R.Krishna Prasad, BIT Bangalore-4

• Problem 2: A repairman is to be hired to
repair machines which breakdown at a n
average rate of 6 per hour. The breakdowns
follow Poisson distribution. The non-
production time of a machine is considered to
cost Rs. 20 per hour. Two repairmen Mr. X and
Mr.Y have been interviewed for this purpose.
Mr. X charges Rs.10 per hour and he service
breakdown machines at the rate of 8 per
hour. Mr. Y demands Rs.14 per hour and he
services at an average of 12 per hour. Which
repairman should be hired? ( Assume 8 hours
shift per day)
C.R.Krishna Prasad, BIT Bangalore-4
• Problem 3: A warehouse has only one loading
dock manned by a three person crew. Trucks
arrive at the loading dock at an average rate
of 4 trucks per hour and the arrival rate is
Poisson distributed. The loading of a truck
takes 10 minutes on an average and can be
assumed to be exponentially distributed .
The operating cost of a truck is Rs.20 per
hour and the members of the crew are paid @
Rs.6 each per hour. Would you advise the
truck owner to add another crew of three
persons?

C.R.Krishna Prasad, BIT Bangalore-4

• Problem 4; At a service counter of fast-
food joint, the customers arrive at the
average interval of six minutes whereas
the counter clerk takes on an average 5
minutes for preparation of bill and
delivery of the item. Calculate the
following
a. counter utilisation level
b. average waiting time of th4e customers
at the fast food joint
c. Expected average waiting time in the line
C.R.Krishna Prasad, BIT Bangalore-4
d. Average number of customers in the service
counter area
e. average number of customer in the line
f. probability that the counter clerk is idle
g. Probability of finding the clerk busy
h. chances that customer is required to wait
more than 30 minutes in the system
i. probability of having four customer in the
system
J) probability of finding more than 3 customer in
the system
C.R.Krishna Prasad, BIT Bangalore-4
• Problem 5: Customers arrive at a one-window drive-in
bank according to a Poisson distribution with mean 10
per hour. Service time per customer is exponential with
mean 5 minutes. The space in front of the window
including that for the serviced car accommodate a
maximum of 3 cars. Other cars can wait outside the
space. Calculate
• A) what is the probability that an arriving customer can
drive directly to the space in front of the window.
• B) what is the probability that an arriving customer will
have to wait outside the indicated space
• C) How long is arriving customer expected to wait before
stating the service.

C.R.Krishna Prasad, BIT Bangalore-4

• D) How many spaces should be provided in front of the
window so that all the arriving customers can wait in
front of the window at least 20% of the time.

Problem 6
Customers arrive at the first class ticket counter of a
theatre at a rate of 12 per hours. There is one clerk
serving the customers at a rate of 30 per hour.
Assuming the conditions for use of the single channel
queuing model, evaluate

C.R.Krishna Prasad, BIT Bangalore-4

a) The probability that there is no
customer at the counter (i.e. that the
system is idle)
b) The probability that there are more
than 20 customers at the counter
c) The probability that there is no
customer waiting to be served
d) The probability that a customer is
being served and no body is waiting.
C.R.Krishna Prasad, BIT Bangalore-4