This course includes the classical theory for queueing systems:
- Basic terminology, Kendall's notation and Little's theorem.
- Discrete and continuous time Markov chains, birth-death processes, and the Poisson process.
- Markovian waiting systems with one or more servers, and systems with infinite as well as finite buffers and finite user populations (M/M/).
- Systems with general service distributions (M/G/1): the method of stages, Pollaczek-Khinchin mean-value formula and systems with priority and interrupted service.
- Loss systems according to Erlang, Engset and Bernoulli.
The theory is illustrated by examples from production and inventory control.