Scribd
Upload
5 views2 pages

Understanding Queueing Models and Theory

Queueing theory is the mathematical study of waiting lines, focusing on predicting queue lengths and waiting times. Key components include arrival patterns, service mechanisms, queue disciplines, and customer behaviors such as balking and reneging. The document outlines various queuing models, their measures, and Kendall's notation for representation.

Uploaded by

guruviswa
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
5 views2 pages

Understanding Queueing Models and Theory

Queueing theory is the mathematical study of waiting lines, focusing on predicting queue lengths and waiting times. Key components include arrival patterns, service mechanisms, queue disciplines, and customer behaviors such as balking and reneging. The document outlines various queuing models, their measures, and Kendall's notation for representation.

Uploaded by

guruviswa
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

QUEUING MODELS

Meaning
 Queueing theory is the mathematical study of waiting lines, or queues. In queueing
theory, a model is constructed so that queue lengths and waiting time can be predicted.
 Arriving people are called customers
 Person who gives the service is called server.
QUEUING SYSTEM
 The input or Arrival pattern - It is the customers who joins or arrive at system: Poisson
 The Service Mechanism or Service pattern – no. of customers can be served at a time
 The queue discipline
 Customer’s behaviour
Queue Discipline
FCFS - First Come First Serve
FIFO - First In First Out
LIFO - Last In First Out
SIRO - Selection for Service in Random Order
Customer’s Behaviour
 Balking: A customer who leaves the queue, when the queue is too long and also he
has no time to wait.
 Reneging: A customer leaves the queue due to impatience.
 Priorities: In certain applications some customers are served before others regardless
of their order of arrival.
 Jockeying: Customers may jump from one waiting line to another.
Transient and Steady State
 Transient: A system is said to be in transient state when its operating characteristics
are dependent on time.
 Steady State: A system is said to be in steady state when the behaviour of the system
is independent on time.
KENDAL’S NOTATION FOR REPRESENTING QUEUING MODELS:
Generally queuing model may be completely specified in the following symbol form
a|b|c:d|e
a = Probability law for the arrival.
b = Probability law according to which customers to be served
c = Number of channels or service station
d = Capacity of the system
e = Queue discipline
Model I – (M | M | 1) : (∞ | FCFS)
Measures of the model

1. System Utilization (ρ) = Arrival Rate =

(or) Traffic Intensity Service Rate


2. Expected (average) number of units in the system (Ls)
Ls = ρ
1–ρ
3. Expected (average) number of units in the system (Lq)

Lq = ρ2 or Ls -

1–ρ
4. Expected waiting time in the system (Ws)
Ws = Ls or 1

5. Expected waiting time in the Queue (Wq)


Wq = Lq or 1

( )
6. Probability of zero customers in queue.
P0 = 1 - ρ
7. Probability of ‘n’ no. of customers in queue
Pn = (1 - ρ) ρn
Model I – (M | M | 1) : (N | FCFS)
Measures of the model

1. System Utilization (ρ) = Arrival Rate =

(or) Traffic Intensity Service Rate


2. Probability of ‘0’ number in queue
P0 = 1 - ρ (ρ >1 is not allowed)
1 - ρ N+1
3. Probability of ‘n’ number in queue
Pn = ρ N 1 - ρ 6. Waiting time in the queue

1 - ρ N+1 Wq = Lq

4. Length of the System (Ls)


Ls = P0 ∑𝑁
𝑛=0(𝑛ρ^n) 7. Waiting time in the system
5. Length of the queue (Lq) Ws = Ls
Lq = Ls -

You might also like