Queuing Rule of Thumb

Last updated October 31, 2023

The Queuing Rule of Thumb (QROT) is a mathematical formula, known as the queuing constraint equation when it is used to find an approximation of servers required to service a queue. The formula is written as an inequality relating the number of servers (s), total number of service requestors (N), service time (r), and the maximum time to empty the queue (T):

Formula

A derivation of the QROT formula follows. The arrival rate is the ratio of the total number of customers N and the maximum time needed to finish the queue T.

\lambda ={\frac {N}{T}}

The service rate is the reciprocal of service time r.

\mu ={\frac {1}{r}}

It is convenient to consider the ratio of the arrival rate and the service rate.

\rho ={\frac {\lambda }{\mu }}

Assuming s servers, the utilization of the queuing system must not be larger than 1.

U={\frac {\rho }{s}}<1

Combining the first three equations gives $\rho ={\frac {\lambda }{\mu }}={\frac {Nr}{T}}$ . Combining this and the fourth equation yields $U={\frac {\rho }{s}}={\frac {Nr}{Ts}}<1$ .

Simplifying, the formula for the Queuing Rule of Thumb is $s>{\frac {Nr}{T}}$ .

Usage

The Queuing Rule of Thumb assists queue management to resolve queue problems by relating the number of servers, the total number of customers, the service time, and the maximum time needed to finish the queue. To make a queuing system more efficient, these values can be adjusted with regards to the rule of thumb.^[3]

The following examples illustrate how the rule may be used.

Conference lunch

Conference lunches are usually self-service. Each serving table has 2 sides where people can pick up their food. If each of 1000 attendees needs 45 seconds to do so, how many serving tables must be provided so that lunch can be served in an hour?^[2]

Solution: Given r = 45, N = 1000, T = 3600, we use the rule of thumb to get s: $s>{\frac {Nr}{T}}\Longrightarrow s>{\frac {1000\times 45}{3600}}\Longrightarrow s>12.5$ . There are two sides of the table that can be used. So the number of tables needed is ${\frac {12.5}{2}}=6.25$ . We round this up to a whole number since the number of servers must be discrete. Thus, 7 serving tables must be provided.^[2]

Student registration

A school of 10,000 students must set certain days for student registration. One working day is 8 hours. Each student needs about 36 seconds to be registered. How many days are needed to register all students?^[2]

Solution: Given s = 1, N = 10,000, r = 36, the rule of thumb yields T: $s>{\frac {Nr}{T}}\Longrightarrow T>{\frac {Nr}{s}}\Longrightarrow T>{\frac {10,000\times 36}{1}}\Longrightarrow T>360,000$ . Given the work hours for a day is 8 hours (28,800 seconds), the number of registration days needed is $\left\lceil {\frac {360,000}{28,800}}\right\rceil =13$ days.^[2]

Drop off

During the peak hour of the morning about 4500 cars drop off their children at an elementary school. Each drop-off requires about 60 seconds. Each car requires about 6 meters to stop and maneuver. How much space is needed for the minimum drop off line?^[2]

Solution: Given N = 4500, T = 60, r = 1, the rule of thumb yields s: $s>{\frac {Nr}{T}}\Longrightarrow s>{\frac {4500\times 1}{60}}\Longrightarrow s>75$ . Given the space for each car is 6 meters, the line should be at least $75\times 6=450$ meters.^[2]

Related Research Articles

<span class="mw-page-title-main">Queueing theory</span> Mathematical study of waiting lines, or queues

Queueing theory is the mathematical study of waiting lines, or queues. A queueing model is constructed so that queue lengths and waiting time can be predicted. Queueing theory is generally considered a branch of operations research because the results are often used when making business decisions about the resources needed to provide a service.

The Liouville lambda function, denoted by λ(n) and named after Joseph Liouville, is an important arithmetic function. Its value is +1 if n is the product of an even number of prime numbers, and −1 if it is the product of an odd number of primes.

The Einstein–Hilbert action in general relativity is the action that yields the Einstein field equations through the stationary-action principle. With the (− + + +) metric signature, the gravitational part of the action is given as

In mathematics, the representation theory of the symmetric group is a particular case of the representation theory of finite groups, for which a concrete and detailed theory can be obtained. This has a large area of potential applications, from symmetric function theory to quantum chemistry studies of atoms, molecules and solids.

In mathematics, the von Mangoldt function is an arithmetic function named after German mathematician Hans von Mangoldt. It is an example of an important arithmetic function that is neither multiplicative nor additive.

The birth–death process is a special case of continuous-time Markov process where the state transitions are of only two types: "births", which increase the state variable by one and "deaths", which decrease the state by one. It was introduced by William Feller. The model's name comes from a common application, the use of such models to represent the current size of a population where the transitions are literal births and deaths. Birth–death processes have many applications in demography, queueing theory, performance engineering, epidemiology, biology and other areas. They may be used, for example, to study the evolution of bacteria, the number of people with a disease within a population, or the number of customers in line at the supermarket.

In mathematics, Schur polynomials, named after Issai Schur, are certain symmetric polynomials in n variables, indexed by partitions, that generalize the elementary symmetric polynomials and the complete homogeneous symmetric polynomials. In representation theory they are the characters of polynomial irreducible representations of the general linear groups. The Schur polynomials form a linear basis for the space of all symmetric polynomials. Any product of Schur polynomials can be written as a linear combination of Schur polynomials with non-negative integral coefficients; the values of these coefficients is given combinatorially by the Littlewood–Richardson rule. More generally, skew Schur polynomials are associated with pairs of partitions and have similar properties to Schur polynomials.

In queueing theory, a discipline within the mathematical theory of probability, a Jackson network is a class of queueing network where the equilibrium distribution is particularly simple to compute as the network has a product-form solution. It was the first significant development in the theory of networks of queues, and generalising and applying the ideas of the theorem to search for similar product-form solutions in other networks has been the subject of much research, including ideas used in the development of the Internet. The networks were first identified by James R. Jackson and his paper was re-printed in the journal Management Science’s ‘Ten Most Influential Titles of Management Sciences First Fifty Years.’

Bayesian linear regression is a type of conditional modeling in which the mean of one variable is described by a linear combination of other variables, with the goal of obtaining the posterior probability of the regression coefficients and ultimately allowing the out-of-sample prediction of the regressandconditional on observed values of the regressors. The simplest and most widely used version of this model is the normal linear model, in which $given is distributed Gaussian. In this model, and under a particular choice of prior probabilities for the parameters—so-called conjugate priors—the posterior can be found analytically. With more arbitrarily chosen priors, the posteriors generally have to be approximated.$

In queueing theory, a discipline within the mathematical theory of probability, a G-network is an open network of G-queues first introduced by Erol Gelenbe as a model for queueing systems with specific control functions, such as traffic re-routing or traffic destruction, as well as a model for neural networks. A G-queue is a network of queues with several types of novel and useful customers:

In mathematics, Macdonald polynomialsP_λ(x; t,q) are a family of orthogonal symmetric polynomials in several variables, introduced by Macdonald in 1987. He later introduced a non-symmetric generalization in 1995. Macdonald originally associated his polynomials with weights λ of finite root systems and used just one variable t, but later realized that it is more natural to associate them with affine root systems rather than finite root systems, in which case the variable t can be replaced by several different variables t=(t₁,...,t_k), one for each of the k orbits of roots in the affine root system. The Macdonald polynomials are polynomials in n variables x=(x₁,...,x_n), where n is the rank of the affine root system. They generalize many other families of orthogonal polynomials, such as Jack polynomials and Hall–Littlewood polynomials and Askey–Wilson polynomials, which in turn include most of the named 1-variable orthogonal polynomials as special cases. Koornwinder polynomials are Macdonald polynomials of certain non-reduced root systems. They have deep relationships with affine Hecke algebras and Hilbert schemes, which were used to prove several conjectures made by Macdonald about them.

In queueing theory, a discipline within the mathematical theory of probability, the Pollaczek–Khinchine formula states a relationship between the queue length and service time distribution Laplace transforms for an M/G/1 queue. The term is also used to refer to the relationships between the mean queue length and mean waiting/service time in such a model.

In queueing theory, a discipline within the mathematical theory of probability, an M/M/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times have an exponential distribution. The model name is written in Kendall's notation. The model is the most elementary of queueing models and an attractive object of study as closed-form expressions can be obtained for many metrics of interest in this model. An extension of this model with more than one server is the M/M/c queue.

In queueing theory, a discipline within the mathematical theory of probability, Kingman's formula also known as the VUT equation, is an approximation for the mean waiting time in a G/G/1 queue. The formula is the product of three terms which depend on utilization (U), variability (V) and service time (T). It was first published by John Kingman in his 1961 paper The single server queue in heavy traffic. It is known to be generally very accurate, especially for a system operating close to saturation.

In queueing theory, a discipline within the mathematical theory of probability, the M/M/c queue is a multi-server queueing model. In Kendall's notation it describes a system where arrivals form a single queue and are governed by a Poisson process, there are c servers, and job service times are exponentially distributed. It is a generalisation of the M/M/1 queue which considers only a single server. The model with infinitely many servers is the M/M/∞ queue.

In queueing theory, a discipline within the mathematical theory of probability, an M/G/1 queue is a queue model where arrivals are Markovian, service times have a General distribution and there is a single server. The model name is written in Kendall's notation, and is an extension of the M/M/1 queue, where service times must be exponentially distributed. The classic application of the M/G/1 queue is to model performance of a fixed head hard disk.

In queueing theory, a discipline within the mathematical theory of probability, the M/M/∞ queue is a multi-server queueing model where every arrival experiences immediate service and does not wait. In Kendall's notation it describes a system where arrivals are governed by a Poisson process, there are infinitely many servers, so jobs do not need to wait for a server. Each job has an exponentially distributed service time. It is a limit of the M/M/c queue model where the number of servers c becomes very large.

In queueing theory, a discipline within the mathematical theory of probability, a heavy traffic approximation is the matching of a queueing model with a diffusion process under some limiting conditions on the model's parameters. The first such result was published by John Kingman who showed that when the utilisation parameter of an M/M/1 queue is near 1 a scaled version of the queue length process can be accurately approximated by a reflected Brownian motion.

In queueing theory, a discipline within the mathematical theory of probability, an M/D/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times are fixed (deterministic). The model name is written in Kendall's notation. Agner Krarup Erlang first published on this model in 1909, starting the subject of queueing theory. An extension of this model with more than one server is the M/D/c queue.

<span class="mw-page-title-main">Representations of classical Lie groups</span>

In mathematics, the finite-dimensional representations of the complex classical Lie groups $,,,,, can be constructed using the general representation theory of semisimple Lie algebras. The groups,, are indeed simple Lie groups, and their finite-dimensional representations coincide with those of their maximal compact subgroups, respectively,, . In the classification of simple Lie algebras, the corresponding algebras are$

References

1 2 Teknomo, Kardi (2012). "Queuing Rule of Thumb based on M/M/s Queuing Theory with Applications in Construction Management". Civil Engineering Dimension. 14 (3). doi: 10.9744/ced.14.3.139-146 . S2CID 53757029.
1 2 3 4 5 6 7 8 Teknomo, Kardi. "Queuing Rule of Thumb".
↑ Teknomo, Kardi (April 2016). Queuing Rule of Thumb. MathCon.

External links

Queueing Rule of Thumb Calculator

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[paperq-1] 1 2 Teknomo, Kardi (2012). "Queuing Rule of Thumb based on M/M/s Queuing Theory with Applications in Construction Management". Civil Engineering Dimension. 14 (3). doi: 10.9744/ced.14.3.139-146 . S2CID 53757029.

[webq-2] 1 2 3 4 5 6 7 8 Teknomo, Kardi. "Queuing Rule of Thumb".

[confq-3] Teknomo, Kardi (April 2016). Queuing Rule of Thumb. MathCon.

[1]

[2]

[3]