Queuing Theory

While seemingly obscure, the use of queuing theory is actually quite common. This guide is a primer for learners and scholars alike.

1.1. INTRODUCTION

1.2. QUEUING PROCESS

1.3. STATES OF THE SYSTEM

1.4. POISSON PROCESS
1.5. MORE DISTRIBUTIONS
1.6. DISTRIBUTION OF SERVICE TIME
1.7. CLASSIFICATION QUEUE MODELS
1.8. SOLUTION OF THE MODEL
1.9. MODEL-I M/M/1 : ( /FIFO)
1.10. AN IMPORTANT DISTRIBUTION
1.11. GENERALISATION OF MODEL M/M/l : ( /FIFO)
1.12. M/M/1 : (N/FIFO), i.e., A SYSTEM WITH POISSON INPUT, POISSON OUTPUT, SINGLE CHANNEL, CAPACITY OF THE SYSTEM IS EQUAL TO N AND FIRST IN FIRST OUT DISCIPLINE
1.13. MODEL M/M/1 : WITH SIRO OR LIFO
1.14. M/M/c : ( /FIFO)
1.15. MODEL M/M/c : (N/FIFO); N > c
1.16. MODEL M/EK/1 : ( /FIFO)
1.17. MODEL M/EK/1 : (1/FIFO)
1.18. DETERMINISTIC MODELS, D/D/1
1.19. MODEL M/D/1
1.20. MACHINE REPAIR PROBLEM