โ Operations Research learning pathOperations Research ยท Module 8 of 10
Queuing theory
Waiting lines and service capacity.
๐ Key ideas
- Queuing theory studies waiting lines: arrivals, service and queue discipline.
- In the M/M/1 model: arrival rate lambda, service rate mu, utilisation rho = lambda / mu (must be below 1).
- Average number in system L = lambda / (mu - lambda); average time in system W = 1 / (mu - lambda).
- Little's law: L = lambda W.
- Adding servers or speeding service reduces waiting.
๐ก Real-life example: Like a ticket counter: if customers arrive faster than they are served, the queue keeps growing.
Arrival rateAverage customers arriving per unit time
Service rateAverage customers served per unit time
Utilisationlambda / mu
Little's lawL = lambda W