Scribd
Upload
44 views28 pages

Queuing Theory

Queuing theory is the study of waiting lines. It examines characteristics like arrival patterns, population size, and service times. Models use Kendall notation to describe systems like single or multi-channel configurations with Poisson arrivals and exponential service times. Common queuing equations calculate values like average time in the system and queue, number of customers, and utilization rate. An example applies these to a muffler shop initially with one mechanic then adding a second to determine how it impacts the waiting line.

Uploaded by

afdsalado113
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
44 views28 pages

Queuing Theory

Queuing theory is the study of waiting lines. It examines characteristics like arrival patterns, population size, and service times. Models use Kendall notation to describe systems like single or multi-channel configurations with Poisson arrivals and exponential service times. Common queuing equations calculate values like average time in the system and queue, number of customers, and utilization rate. An example applies these to a muffler shop initially with one mechanic then adding a second to determine how it impacts the waiting line.

Uploaded by

afdsalado113
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 28

QUEUING

THEORY
DEFINITION
The study of waiting line is called
queuing theory.
Information required to solve the queuing
problem
Characteristics of Queuing System
1. The arrivals or inputs to the system
(sometimes referred to as the
calling population)
2. The queue or the waiting line itself
3. The service facility
Arrival Characteristics
1. The size of the calling population
2. The pattern of arrivals at the
queuing system
3. The behavior of the arrivals
SIZE OF THE CALLING POPULATION
▪ Population sizes are considered to be
either unlimited (essentially infinite) or
limited (finite).
PATTERN OF ARRIVALS AT THE
SYSTEM
▪ Customers either arrive at a service
facility according to some known schedule
or else they arrive randomly.
BEHAVIOR OF THE ARRIVALS
▪ Balking
▪ Reneging
WAITING LINE CHARACTERISTICS
▪ Limited or Unlimited Queue Length

▪ Queue discipline
Service Facility Characteristics
1. The configuration of the service
system
2. The pattern of service times
Basic Queuing System Configurations
Single-channel system – with one
server
Multi-channel system
Single-phase system – is one in
which the customer receives service
from only one station and then exits the
system.
Multi-phase system
Identifying Models Using Kendall Notation
The basic three-symbol Kendall Notation is in the form:
Arrival distribution/Service time distribution/Number of
Service Channels open

The following letters are commonly used in Kendall Notation:


M = Poison distribution for number of occurrences (or
exponential times)
D = Constant (deterministic) rate
G = General distribution with mean and variance known
Four Basic Queuing System Configurations

Queue

Service Departures
Arrivals
Facility after Service

Single-Channel, Single-Phase System


Queue
Type 1 Type 2
Departures
Arrivals Service Service
after Service
Facility Facility

Single-Channel, Multi-Phase System


Service
Facility Departures
Queue 1

Service
Arrivals Facility after
2

Service
Facility Service
3

Multi-Channel, Single-Phase System


Queue Type 1 Type 2
Service Service
Facility Facility
1 1 Departures
Arrivals after Service

Type 1 Type 2
Service Service
Facility Facility
2 1

Multi-Channel, Multi-Phase System


Single-Channel Queuing Models with Poision
Arrivals and Exponential Service Times(M/M/1)
QUEUING EQUATIONS:
λ = mean number of arrivals per time
period (for example, per hour)

μ = mean number of people or items


served per time period
The queuing equations follow:
1. The average number of customers or units in
the system, L, that is, the number in line plus the
number being served:
λ
𝐿𝑠 =
μ−λ

2. The average time a customer spends in the


system, W, that is, the time spent in line plus the
time spent being served:
1
𝑊𝑠 =
μ−λ
3. The average number of customers in the queue,
𝐿𝑞 :
λ2
𝐿𝑞 =
μ (μ − λ)
4. The average time a customer spends waiting in
the queue, 𝑊𝑞 :
λ
𝑊𝑞 =
μ (μ − λ)
5. The utilization factor for the system, that is, the
probability that the service facility is being used:
λ
ρ=
μ
6. The percent idle time, 𝑃0 , that is, the
probability that no one is in the system:
λ
𝑃0 = 1 −
μ
7. The probability that the number of
customers in the system is greater than k,
𝑃𝑛>𝑘 :
λ 𝑘+1
𝑃𝑛>𝑘 = ( )
μ
Example
Arnold’s Mechanic, Reid Blank, is able to install
new mufflers at an average rate of 3 per hour,
or about 1 every 20 minutes. Customers
needing this service arrive at the shop on the
average of 2 per hour. Larry Arnold, the shop
owner, studied queuing models in an MBA
program and feels that all seven of the
conditions for a single-channel model are met.
He proceeds to calculate the numerical values
of the preceding operating characteristics.
Equations for the Multichannel Queuing Model

QUEUING EQUATIONS:
m/s = number of channels open
n = specific server number
λ = average arrival rate, and
μ = average service rate at each channel
The queuing equations follow:
1. The probability that there are zero customers or
units in the system:

2. The average number of customers or units in


the system:
3. The average time a unit spends in the waiting
line or being serviced (namely, in the system):

4. The average number of customers or units in


line waiting for service:
λ
𝐿𝑞 = 𝐿 −
μ
5. The average time a customer or unit spends in
the queue waiting for service:

1 𝐿𝑞
𝑊𝑞 = 𝑊 − =
μ λ

6. Utilization rate:
λ
ρ=
𝑚μ
Arnold’s Muffler Shop Revisited
For an application of the multichannel queuing
model, let’s return to the case of Arnold’s Muffler
Shop. Instead of firing his first mechanic, Blank, he
would hire a second worker. The new mechanic
would be expected to install mufflers at the same
rate as Blank—about per hour. Customers, who
would still arrive at the rate of l = 2 per hour, would
wait in a single line until one of the two mechanics
is free. To find out how this option compares with
the old single-channel waiting line system, Arnold
computes several operating characteristics for the
channel system:
EXAMPLE
1. Lenny, a graduate research assistant “moonlights” at the short order counter
in the student union snack bar in the evenings. He is the only one on duty at the
counter during the hours he works. Arrivals to the counter seem to follow the
Poisson distribution with the mean of 8 per hour. Each customer is served one
at a time and the service time follows an exponential distribution with a mean of
5 minutes.

(a) How long will a student wait in line, on average (in minutes)?
(b) The manager thinks that students will go elsewhere for lunch if they have to
wait more than 5 minutes. Therefore, he’s thinking of hiring another server to
help Lenny, reducing the customer service time to 4 minutes. How long will
students wait in line if Lenny gets help?
SEATWORK
1. People arrive at a cinema ticket booth in a poisson
distributed arrival rate of 25per hour. Service rate is
exponentially distributed with an average time of 2 min.
Calculate the following:
a. Mean number in waiting line
b. Mean waiting time
c. Mean time in the system
d. Utilization rate
END OF PRESENTATIONS

You might also like