UsefulLinks
Systems Science
Queueing Theory and Scheduling
1. Introduction to Queueing Systems
2. Mathematical Foundations
3. Basic Markovian Queueing Models
4. Advanced Queueing Models
5. Queueing Networks
6. Fundamentals of Scheduling
7. Single Machine Scheduling
8. Parallel Machine Scheduling
9. Flow Shop and Job Shop Scheduling
10. Real-Time Scheduling
11. Network Scheduling
12. Analysis Techniques and Tools
13. Performance Evaluation and Optimization
14. Applications and Case Studies
5.
Queueing Networks
5.1.
Introduction to Queueing Networks
5.1.1.
Network Topology
5.1.2.
Routing Mechanisms
5.1.3.
Customer Classes
5.2.
Open Queueing Networks
5.2.1.
Jackson Networks
5.2.1.1.
Network Structure
5.2.1.2.
Product-Form Solution
5.2.1.3.
Traffic Equations
5.2.1.4.
Performance Analysis
5.2.2.
BCMP Networks
5.2.2.1.
Customer Classes
5.2.2.2.
Service Disciplines
5.2.2.3.
Product-Form Conditions
5.2.3.
Non-Product-Form Networks
5.2.3.1.
Approximation Methods
5.2.3.2.
Decomposition Techniques
5.3.
Closed Queueing Networks
5.3.1.
Gordon-Newell Networks
5.3.1.1.
Network Structure
5.3.1.2.
Product-Form Solution
5.3.1.3.
Normalization Constant
5.3.2.
Mean Value Analysis (MVA)
5.3.2.1.
Exact MVA Algorithm
5.3.2.2.
Approximate MVA
5.3.2.3.
Computational Complexity
5.3.3.
Convolution Algorithm
5.3.4.
BCMP Closed Networks
5.4.
Mixed Queueing Networks
5.4.1.
Network Structure
5.4.2.
Solution Methods
5.4.3.
Performance Analysis
5.5.
Network Applications
5.5.1.
Computer Systems
5.5.2.
Communication Networks
5.5.3.
Manufacturing Systems
Previous
4. Advanced Queueing Models
Go to top
Next
6. Fundamentals of Scheduling