Accelerating the pace of engineering and science
Queuing Theory |
Explore queuing theory for scheduling, resource allocation and traffic flow applications
Queuing theory is the mathematical study of waiting lines or queues. This approach is applied to different types of problems, such as scheduling, resource allocation and traffic flow. It is often applied in:
- Operations research
- Industrial engineering
- Network design
- Computer architecture
You can explore queuing theory by modeling, measuring and analyzing the arrival, wait and service times of queuing systems with MATLAB, Statistics Toolbox and SimEvents.
Examples and How To
- M/M/1 Queuing Theory (Example)
- M/D/1 Queuing System (Example)
- G/G/1 Queuing System and Little's Law (Example)
- Generating Entities as a Markov-Modulated Poisson Process (Example)
- Modeling Variable Size Buffers Using Queues (Example)
Software Reference
- SimEvents (Main Documentation)
- Basic queues and servers in SimEvents (Getting Started Documentation)
- Modeling queues and servers in SimEvents (Documentation)
- Routing techniques in SimEvents (Documentation)
- Using statistics in SimEvents (Documentation)
- Statistics Toolbox for further analysis (Main Documentation)
- Resource allocation optimization with Mixed Integer Optimization (Documentation)
See also: Discrete Event Simulation, SimEvents, Statistics Toolbox, Genetic Algorithm, Random Number, System Design and Simulation
