Queueing theory

Queueing theory is the mathematical study of waiting lines, or queues. It helps us understand how long people might have to wait in line and how to make those lines more efficient. By creating models, scientists can predict how long a line will be and how much time people will spend waiting.

This idea began with a man named Agner Krarup Erlang, who worked for a telephone company in Copenhagen. He wanted to figure out how to handle all the calls that came in, so he created models to describe the flow of calls. His work laid the foundation for a whole field called teletraffic engineering.

Today, queueing theory is used in many areas, including telecommunications, traffic planning, computing, project management, and industrial engineering. It helps design better systems in factories, shops, offices, and even hospitals, making sure that services run smoothly and people don’t wait too long.

Description

Queueing theory is a key part of management science, helping businesses solve problems with math. It studies waiting lines, or queues, to predict how long people might wait. By looking at chances — or probabilities — instead of exact times, queueing analysis can find average wait times, how many people might be waiting, and whether servers (like cashiers) are busy or free.

The main goal is to compare the current system with possible changes to find the best way to save money, cut down waiting time, and work more efficiently. Two common models are single-server systems (one person serving) and multiple-server systems (several people serving), and they can vary based on things like service time length and the number of people waiting.

Single queueing nodes

A queue or queueing node can be thought of as a black box. Jobs, also called customers or requests, arrive to the queue, possibly wait some time, get processed, and then leave.

The queue has one or more servers that handle the jobs. For example, at a supermarket, customers arrive and are served by a cashier, who processes one customer at a time. If the cashier is busy, customers might wait in line, or they might leave right away if there’s no waiting area.

Queueing networks

Queue networks are systems where several lines of waiting, called queues, are connected. After a person or item is helped at one spot, they might move to another spot to wait again, or they might leave the whole system.

These networks can be described using numbers. For a network with m spots, we can use an m–dimensional vector (x₁, x₂, ..., x_m) where each x_i shows how many people or items are waiting at each spot. Some special kinds of queue networks, like tandem queues and Jackson networks, help us understand how these systems work on average.

Queueing theory is used in many places, like computers and networks, to help make things run better. It helps us understand how to make waiting lines shorter and systems faster, whether it's at a supermarket, on the internet, or in many other places.