Queuing Theory

In this chapter, we will first understand the queue system terminology used to describe the different parts of the queue and then discuss six different types of queue systems. Following that, we will discuss queue performance and the Kendall’s Notation to represent a queue. The universal relationships which include Little’s Law are discussed and applied to four queue systems, M/M/1, M/M/m, G/G/1 and G/G/m. Finally, a case study on determining the optimal system length to trigger queue busting in a grocery store will be discussed.