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
Advanced Queueing Models
Non-Markovian Single-Server Queues
The M/G/1 Queue
Model Assumptions
Embedded Markov Chain
Pollaczek-Khinchine Formula
Residual Service Time
Waiting Time Analysis
Busy Period Analysis
Transform Methods
The G/M/1 Queue
Model Assumptions
Embedded Markov Chain
Solution Techniques
Performance Analysis
The G/G/1 Queue
Model Assumptions
Lindley's Equation
Approximation Methods
Kingman's Formula
Heavy Traffic Approximations
Priority Queueing Systems
Priority Disciplines
Non-preemptive Priority
Preemptive-Resume Priority
Preemptive-Repeat Priority
M/G/1 Priority Queues
Non-preemptive Analysis
Preemptive Analysis
Waiting Time Distributions
Multi-class Priority Systems
Dynamic Priority Systems
Queueing Systems with Special Features
Queues with Impatient Customers
Balking
Reneging
Jockeying
Queues with Server Vacations
Single Vacation Models
Multiple Vacation Models
Vacation Policies
Queues with Breakdowns
Server Reliability
Repair Time Analysis
Batch Service Queues
Fixed Batch Size
Variable Batch Size
Threshold Policies
Multi-Server Non-Markovian Queues
M/G/c Queue
G/M/c Queue
Approximation Methods
Performance Analysis
Previous
3. Basic Markovian Queueing Models
Go to top
Next
5. Queueing Networks