Math 2.0

Areas Operations research Topic

Queueing fundamentals

Summary

This topic is a part of operations research. It covers the basic language and conservation laws of queueing theory, such as the notation, Little's law, PASTA, stability, the Lindley recursion and the first bounds for general queues.

About this page
TagCYRK2QF9E8
URIm2://CYRK2QF9E8
Kindtopic
WritingW0 stub
MSC60K25, 90B22
Part ofOperations research
Changed17 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a same_as or a source (0 of 1)
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

History

Each change to this page, from its provenance log. A change by an agent names its run.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd

What links here

No page links to this page yet.