What is
Queuing Theory?
IMage:https://community.alteryx.com/t5/Engine-Works/Tackling-Queued-Jobs-With-Queueing-Theory-Part-1/ba-p/475036
Queuing theory refers to the mathematical study of
the formation, function, and congestion of waiting
lines, or queues. It’s also referred to as queueing
theory, queue theory, and waiting line theory.
Image:https://www.wallstreetmojo.com/queuing-theory/
Queuing theory scrutinizes the entire system of
waiting in line, including elements like the customer
arrival rate, number of servers, number of customers,
capacity of the waiting area, average service
completion time, and queuing discipline.
Basic Elements of Queuing Theory
Arrival Process: The way customers arrive at the
system, which can be described by an arrival rate
and a probability distribution.
Service Process: The service aspect can be
constructed from a service rate and a probability
distribution for customers who are served.
Queue Discipline: The method used to serve the
customers or the order in which the customers are
served such as the first come first served (FCFS) or
priority-based.
Number of Servers: The number of servers available
to serve the customers.
System Capacity: Limit of customers who may attend
the system at a particular time including those being
served and those waiting for their turn.
Performance Measures: Quantitative measures that
are used to measure the performance of the system
like the queue length, waiting time, and server
utilization.
Image:https://resources.noodle.com/articles/what-is-queuing-theory/
Working of Queuing Theory
Queuing theory works by modeling a system as a series of
components:
Arrival Process: The way customers arrive at the system,
which can be described by an arrival rate and a probability
distribution.
Queue: The waiting line where customers wait for service.
Service Process: A specific way of customers being served
that may be quantified using a service rate and the
probability distribution.
Service Discipline: The system of serving the customers
such as first come first serve (FCFS) or the prioritized
system.
Queuing Theory Parameters
Refers to the customers who arrive and are first
Arrival
in line
Queue or Service Refers to the limits of the system as per the
Capacity number of customers in line
Refers to the total number of employees serving
Number of Servers
the customers in line
Size of the Client
Refers to the total number of customers in line
Population
Refers to how requests are delivered to the
Queuing Discipline
servers (includes first-in, first-out)
Refers to customers leaving after receiving
Departure Process
service
Image:https://www.researchgate.net/figure/A-general-queuing-model-of-Kendalls-notation_fig2_307111014
Queuing theory uses the Kendall notation to classify the
different types of queuing systems, or nodes. Queuing nodes
are classified using the notation A/S/c/K/N/D where:
A is the arrival process
S is the mathematical distribution of the service time
c is the number of servers
K is the capacity of the queue, omitted if unlimited
N is the number of possible customers, omitted if unlimited
D is the queuing discipline, assumed first-in-first-out if
omitted
Learn Mechanical Tools
Anytime, Anywhere
Join 30+ industry-relevant mechanical engineering
courses covering essential tools like CNC
Programming, GD&T, CMM, AutoCAD,Solidworks,
Industry 4.0, 3D Printing, and more.
(For More info Check in Bio)
Found this Helpful?
Repost this to help
someone in your network
