Queuing Theory
Queuing Theory
UNIT-5
OPERATIONS RESEARCH
(A.Y. 2022-23)
Intro to Q
• Queuing theory refers to the study
comprising a queue’s features, functions,
and imperfections. This mathematical
study is very relevant in operations
research since its appropriate application
helps in eliminating operational
bottlenecks and service failures.
What Is Queuing Theory?
• Example:
Consumers trying to deposit or withdraw money
are the customers, and bank tellers are the servers
in a bank queuing situation. The customers in a
printer's queue scenario are the requests that have
been made to the printer, and the server is the
printer.
• Example:
Queuing theory in operation research examines
the entire system of standing in line, including
factors such as customer arrival rate, number of
servers, number of customers, waiting room
capacity, average service completion time, and
queuing discipline. The rules of the queue, such
as whether it operates on a first-in-first-out, last-
in-first-out, prioritized, or serve-in-random-order
basis, are referred to as queuing discipline.
• Agner Krarup Erlang, a Danish mathematician
and engineer, was the first to establish queuing
theory in the early twentieth century.