Chapter 7 - Queuing Model
Chapter 7 - Queuing Model
Queuing (Waiting
line) Models
By: Getachew Gobena (Asst. Prof.)
D-1
Outline
7.1. Queuing (Waiting Line) Model
7.2. Elements of a Waiting-Line System
Arrival Characteristics
Waiting-Line Characteristics
Service Characteristics
7.3. Waiting Line (Queuing) Performance Measures
7.4. Poisson Distribution
7.5. Queuing (waiting Line) Models Application
Single-Server Waiting Line Model
7.5. Changing Operational Characteristics
2
Learning Objectives
1. Describe the characteristics of arrivals, waiting
lines, and service systems;
3
7.1. Queuing Model overview
Waiting line system (or queuing
system) is defined by two
elements: the population source of
its customers and the process or
service system itself.
4
Common Queuing Situations
Table D.1 5
7.2. Elements of Waiting-Line Systems
6
Parts of a Waiting Line
Population of Arrivals Queue Service Exit the system
dirty cars from the (waiting line) facility
general
population …
Dave’s
Car Wash
Enter Exit
7
1. Arrival Characteristics
i. Size of the population
Unlimited (infinite) or limited (finite)
o Finite customer population: The number of potential
new customers is affected by the number of customers
already in the system.
o Infinite customer population: The number of potential new
customers is not affected by the number of customers already in
the system.
ii. Pattern of arrivals
Scheduled or random, often a Poisson distribution
iii. Behavior of arrivals
Wait in the queue and do not switch lines
No balking or reneging or jockeying
Balking: The customer decides not to enter the waiting line.
Reneging: The customer enters the line but decides to exit before being served.
Jockeying: The customer enters one line and then switches to a different line in an
effort to reduce the waiting time. 8
2. Waiting-Line Characteristics
The waiting line system is characterized by the number
of waiting lines, the number of servers, the arrangement
of the servers, the arrival and service patterns, and the
service priority rules.
Limited or unlimited queue length
Queue discipline :
A frequently used priority rule is first-come, first-
served (FIFO). This priority rule selects customers
based on who has been waiting the longest in line.
Generally, customers consider first-come, first-served
to be the fairest method for determining priority.
Other priority rules may be used in special
circumstances. 9
3. Service Characteristics
Queuing system designs
Single-channel system, multiple-
channel system
Single-phase system, multiphase system
Service time distribution
Constant service time
Random service times
10
Queuing System Designs
A family dentist’s office
Queue
Service Departures
Arrivals facility after service
Queue
Phase 1 Phase 2 Departures
Arrivals service service
after service
facility facility
11
Queuing System Designs
Most bank, post office & Airport service windows
Service
facility
Channel 1
Queue
Service Departures
Arrivals facility
after service
Channel 2
Service
facility
Channel 3
12
Queuing System Designs
Phase 1 Phase 2
service service
Queue facility facility
Channel 1 Channel 1
Departures
Arrivals after service
Phase 1 Phase 2
service service
facility facility
Channel 2 Channel 2
13
7.3. Waiting Line (Queuing) Performance
Measures
14
7.3. Waiting Line (Queuing) Performance
Measures Cont’d
15
7.3. Waiting Line (Queuing) Performance
Measures Cont’d
16
7.3. Waiting Line (Queuing) Performance
Measures Cont’d
We calculate the following measures for the
waiting line model: - the single-server model.
1. Average time that each customer or object spends in the
queue
2. Average queue length
3. Average time each customer spends in the system
4. Average number of customers in the system
5. Probability that the service facility will be idle
6. Utilization factor for the system
7. Probability of a specific number of customers in the
system
17
7.4. Poisson Distribution
The Poisson distribution is a discrete probability distribution
for the counts of events that occur randomly in a given interval
of time (or space).
e-x
P(x) = x! for x = 0, 1, 2, 3, 4, …
where P(x) = probability of x arrivals
x = number of arrivals per unit of time
= average arrival rate
e = 2.7183 (which is the mathematical
constant) 18
7.5. Queuing Models Application
Model Name Example
A Single-channel Information counter
system at department store
(M/M/1)
19
Model A: Single-Channel/Server Model
20
Single- Server Model
Table D.3
21
Single-Server Model
P0 = Probability of 0 units in the system (that is, the
service unit is idle)
= 1–
µ
22
Single- Server Model Cont’d
23
Single- Server Model Cont’d
24
Practice Problems
Problem 1:
A new shopping mall is considering setting up an information desk manned by
one employee. Based upon information obtained from similar information
desks, it is believed that people will arrive at the desk at a rate of 20 per hour.
It takes an average of 2 minutes to answer a question. It is assumed that the
arrivals follow a Poisson distribution and answer times are exponentially
distributed.
(a) Find the probability that the employee is idle.
(b) Find the proportion of the time that the employee is busy.
(c) Find the average number of people receiving and waiting to receive some
information.
(d) Find the average number of people waiting in line to get some information.
(e) Find the average time a person seeking information spends in the system.
(f) Find the expected time a person spends just waiting in line to have a
question answered (time in the queue).
25
7.6. Changing Operational
Characteristics
After calculating the operating characteristics for a waiting line
system, sometimes you need to change the system to alter its
performance.
Let’s look at the type of changes you can make to the different
elements of the waiting line system. These include:
Customer arrival rates: You can try to change arrival rates in a number
of ways. For example, you can provide discounts or run special promotions
during the non-peak hours to attract customers.
Number and type of service facilities: You can either increase or
decrease the number of server facilities. For example, a grocery store can
easily change the number of cashiers open for business (up to the number
of registers available). The store increases the number of cashiers open
when lines are too long.
26
7.6. Changing Operational
Characteristics Cont’d
Changing the number of phases: You can use a multiphase
system where servers specialize in a portion of the total service
rather than needing to know the entire service provided.
Server efficiency: You can improve server efficiency through
process improvements or dedication of additional resources. For
example, cashier accuracy and speed are improved through the
use of latest operating machines (scanners).
Changing the priority rule: The priority rule determines
who should be served next. There are priority rules other
than first-come, first-served. If you want to change priority
rules, consider the impact on those customers who will wait
longer.
27
7.6. Changing Operational
Characteristics Cont’d
28