Professional Documents
Culture Documents
Queuing Theory1
Queuing Theory1
Service Level
Optimal
Service Level
Important factors of Queuing Situations
• Arrival pattern
• Service pattern
• Queue discipline
• Customer’s behavior
• Maximum number of customers allowed in the system
• Nature of Calling Source
Queuing System: 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
Common Queuing System Configurations
Customer ... Customer
Arrives Server Leaves
Waiting Line
Customer
Server 1 Leaves
Customer ... Customer
Arrives Waiting Line Server 2 Leaves
Customer
Server 3 Leaves
... Customer
Waiting Line Server 1 Leaves
Customer ... Customer
Arrives Waiting Line Server 2 Leaves
... Customer
Waiting Line Server 3 Leaves
• Queue Structure
• First come first served
• Last come first served
• Service in random order
• Priority service
• Customer Behavior
• Balking
• Reneging
• Jockeying
• Collusion
Characteristics of Queuing Systems:
The Arrival Process
• Arrival rate - the manner in which customers arrive
at the system for service.
Problem 2
The manager of a bank observes that, on average,18
customers are served by a cashier in an hour.
Assuming that the service time has an exponential
distribution, what is the probability that (a) a
customer will be free within 3 minutes,(b)a customer
shall be served in more than 12 minutes.
Kendall Notation
• Queuing systems are described by 3 parameters:
A/B/s
– Parameter A
M = Markovian interarrival times
D = Deterministic interarrival time
– Parameter B
M = Markovian service times
G = General service times
D = Deterministic service times
– Parameter s
A number Indicating the number of servers.
• Examples,
M/M/1 D/G/4 M/G/2
Operating Characteristics
Typical operating characteristics of interest include:
ρ- Utilization factor, % of time that all servers are busy.
P0- Prob. that there are no zero units in the system.
Lq - Avg number of units in line waiting for service.
L - Avg number of units in the system (in line & being
served).
Wq - Avg time a unit spends in line waiting for service.
W - Avg time a unit spends in the system (in line & being
served).
Pw - Prob. that an arriving unit has to wait for service.
Pn - Prob. of n units in the system.
• 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, λ ≤ µ
• Model 2: Poisson-exponential single
server model – finite population
Has same assumptions as model 1, except that
population is finite
• 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
Model: 1 Operating 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
• Measurement parameters
• λ= mean number of arrivals per time period (eg. Per hour)
λ
1−
µ
P ( 0) = x +1
λ
1−
µ
n
λ
P ( n) = P (0)
µ
• Problem: 7:A hospital emergency room can
accommodate at most X=5 patients. The patients
arrive at a rate of 4 per hour. The single staff
physician can only treat 5 patients per hour. Any
patient overflow is directed to another hospital.
(a) Determine the probability distribution for the
number of patients in the hospital.
(b) Determine the mean values for the number
patients in the emergency room, and number of
patients waiting to see the doctor.
• Problem 8:Customers arrive at a one window drive in bank
according to Poisson distribution with mean 10 per hour.
Service time of each customer is exponential with mean 5
minutes. The space in front of the window,including that
for the serviced car can accommodate a maximum of 3
cars.Other cars can wait outside space.
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 an arriving customer expected to wait before
starting the service?