Objective Oriented Learning Process RBT

• Branch: Mechanical Engineering

• Semester : VII

• Subject code & Title: 18ME703 & Operations Research

• Topic : Queueing model - Introduction , elements,
Kendall's Notation, parameters. Single Server with infinite
population - Poisson input, Exponential service and ,
Constant rate service .

• Faculty Name : Mr E Sakthivelmurugan

 Introduction

• The waiting line or queue formation is a

common occurrence in our day to day life.
• Example
• Ships wait in the harbour to be unloaded
• Machines that are out of order repaired in
workshops in a particular sequence
• People purchasing grocery items in stores
stand in a line waiting for their turn
Queuing examples
 Applications of Queuing Theory

• Telecommunications
• Traffic control
• Determining the sequence of computer operations
• Predicting computer performance
• Health services (e.g.. control of hospital bed
assignments)
• Airport traffic, airline ticket sales
• Layout of manufacturing systems.
 Queuing system

• Model processes in which customers arrive.

• Wait their turn for service.
• Are serviced and then leave.
 Characteristics of Queuing Systems

Key elements of queuing systems

• Customer:- refers to anything that arrives at a
facility and requires service, emails.
• Server:- refers to any resource that provides
the requested service, eg. repairpersons,
retrieval machines, requested service, runways
at airport.
Components of a Queuing System
Parts of a Waiting Line
 Contd…

1. Arrival Process
According to source
According to numbers
According to time
2. Queue Structure
First-come-first-served (FCFS)
Last-come-first-serve (LCFS)
Service-in-random-order (SIRO)
Priority service
 Service system

• 1. A single service system.

Multiple, parallel server, single queue
mode
Multiple, parallel facilities with multiple
queues Model
Service facilities in a series
 Assumptions

1. If λ > µ, then waiting line shall be formed

and increased indefinitely and service system
would fail ultimately
2. If λ ≤ µ, there shall be no waiting line
 Classification of Queuing Models
• Different models in queuing theory are classified by using
notations described initially by D.G. Kendall in 1953 in the
form (a/b/c). Later A.M. Lee in 1966 added the symbols d and c
to the Kendall’s notation. The standard format used to describe
the main characteristics of parallel queues is {(a/b/c) : (d/e)}
where
• a = arrivals distribution
• b = service time (or departures) distribution
• c = number of service channels (servers)
• d = queue (or service) discipline.
• e = maximum number of customers allowed in the system
(in queue plus in service)
 Behaviour of arrivals
• Balking: Customers do not join the queue either by seeing the
number of customers already in service system or estimating
the excessive waiting time for desired service.
• Reneging: Customers after joining the queue, wait for
sometime in the queue but leave before being served on
account of certain reasons.
• Jockeying: Customers move from one queue to another hoping
to receive service more quickly (a common scene an railway
booking window)
 Single server queuing models
Model I {(M/M/1) : (FCFS/ ∞)}

Assumptions for the queuing system:

• Arrivals are described by Poisson probability distribution and come from
an infinite population.
• Single waiting line and each arrival waits to be served regardless of the
length of the queue (i.e. infinite capacity) and no balking or reneging.’
• Queue discipline is ‘first-come, first-served’.
• Single server and service times follow exponential distribution.
• Customers arrival is independent but the arrival rate (average number of
arrivals) does not change over time.
• The average service rate is more than the average arrival rate.
 Performance Measures for Model I
• Based on single server queuing system, the probability of no
customer and n customers in the system at time t are given by
• Expected number of customers in the system (customers in the line
plus the customer being served)
• Ls = ρ / 1- ρ = λ / μ - λ
• Expected number of customers waiting in the queue (i.e. queue length)
• Lq = λ2 / μ (μ - λ)
• Expected waiting time for a customer in the queue
• Wq = λ / μ (μ – λ) = Lq / λ
• Expected waiting time for a customer in the system (waiting and service)
Ws = Expected waiting time in queue + Expected service time
• Ws = 1/ (μ - λ) = Ls/ λ
• Probability that the queue is non-empty P (n > 1) = (λ / μ)2
• Probability that the number of customers, n in the system exceeds a given
number k. P (n > k) = (λ / μ)k+1 & P(n= k) = (λ / μ)k
• Expected length of non-empty queue L = μ / (μ – λ)
• Probability of an arrival during the service time when system contains r
customers
• P (n = r) = (λ / λ+ μ)r (μ / λ+ μ)
 Problem 1
• The arrival rate of customers at the single window booking counter of two
wheeler agency follows Poisson distribution and the service time follows
exponential distribution and hence, the service rate also follows Poisson
distribution. The arrival rate and the service rate are 25 customers per hour
and 35 customers per hour, respectively. Find the following:
• 1) Utilization of the booking clerk
• 2) Average number of waiting customers in the queue
• 3) Average number of waiting customers in the system
• 4) Average waiting time per customer in the queue
• 5) Average waiting time per customer in the system
Solution:
λ = 25 customers per hour, µ = 35 customers per hour

1. Utilization of the booking clerk = ρ = λ / μ = 25 / 35 = 0.71429

2. Average number of waiting customers in the queue
Lq = λ2 / μ (μ - λ) = 1.7857 customers
3. Average number of waiting customers in the system
Ls = ρ / 1- ρ = λ / μ - λ = 2.5 customers
4. Average waiting time per customer in the queue
Wq = λ / μ (μ – λ) = Lq / λ = 0.07143 hour = 4.286 minutes
5. Average waiting time per customer in the system
Ws = 1/ (μ - λ) = Ls/ λ = 0.1 hour = 6 minutes
 Problem 2
• The arrival rate of customers at a banking counter follows Poisson
distribution with a mean of 45 per hour. The service rate of the counter
clerk also follows Poisson distribution with a mean of 60 per hour.
1. What is the probability of having 0 customer in the system (P0)?
2. What is the probability of having 5 customer in the system (P5)?
3. What is the probability of having 10 customer in the system (P10)?
4. Find Ls, Lq, Ws, and Wq. (0.25, 0.0593, 0.0141, 3, 2.25, 0.067, 0.05)