Useful Links
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
Queueing Networks
Introduction to Queueing Networks
Network Topology
Routing Mechanisms
Customer Classes
Open Queueing Networks
Jackson Networks
Network Structure
Product-Form Solution
Traffic Equations
Performance Analysis
BCMP Networks
Customer Classes
Service Disciplines
Product-Form Conditions
Non-Product-Form Networks
Approximation Methods
Decomposition Techniques
Closed Queueing Networks
Gordon-Newell Networks
Network Structure
Product-Form Solution
Normalization Constant
Mean Value Analysis (MVA)
Exact MVA Algorithm
Approximate MVA
Computational Complexity
Convolution Algorithm
BCMP Closed Networks
Mixed Queueing Networks
Network Structure
Solution Methods
Performance Analysis
Network Applications
Computer Systems
Communication Networks
Manufacturing Systems
Previous
4. Advanced Queueing Models
Go to top
Next
6. Fundamentals of Scheduling