An Introduction to Queueing Models
This chapter was an introduction to the queueing models. The first part of the chapter introduced very basic concepts including Little’s law, Poisson Arrivals See Time Averages, and the Kendall’s notation for the classification of the queueing models. In the second part of the chapter, the balance equations for a general B&D queueing model, and the balance equations and Little’s law equations for an M/M/1 queueing model with infinite capacity and finite capacity have been provided. The adaptation of the basic formulations to the cases with more than one server, with varying arrival rates and departure rates, and with finite capacity has been illustrated with some examples and problems including the ones related to the arrivals of the customers, and the arrivals of the machines to a repair system.