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
Analysis Techniques and Tools
Analytical Methods
Exact Analysis
Markov Chain Analysis
Transform Methods
Generating Functions
Approximation Methods
Heavy Traffic Approximations
Light Traffic Approximations
Diffusion Approximations
Bounds and Inequalities
Performance Bounds
Stochastic Ordering
Numerical Methods
Matrix-Geometric Methods
Spectral Expansion Method
Iterative Methods
Gauss-Seidel Method
Successive Over-Relaxation
Computational Algorithms
Mean Value Analysis
Convolution Algorithm
Simulation Methods
Discrete-Event Simulation
Event Scheduling
Process Interaction
Activity Scanning
Random Number Generation
Input Modeling
Data Collection
Distribution Fitting
Goodness-of-Fit Tests
Output Analysis
Transient Removal
Confidence Intervals
Variance Reduction Techniques
Validation and Verification
Optimization Techniques
Linear Programming
Integer Programming
Dynamic Programming
Metaheuristics
Genetic Algorithms
Simulated Annealing
Tabu Search
Ant Colony Optimization
Previous
11. Network Scheduling
Go to top
Next
13. Performance Evaluation and Optimization