Useful Links
Systems Science
Operations Research
1. Introduction to Operations Research
2. Mathematical Preliminaries
3. Linear Programming
4. Transportation and Assignment Problems
5. Network Optimization Models
6. Integer Programming
7. Nonlinear Programming
8. Dynamic Programming
9. Stochastic Processes and Markov Chains
10. Queueing Theory
11. Inventory Theory
12. Simulation
13. Decision Analysis
14. Heuristics and Metaheuristics
Queueing Theory
Structure of Queueing Systems
System Components
Arrival Process
Service Mechanism
Queue Discipline
System Capacity
Customer Population
Performance Measures
Queue Length
Waiting Time
System Utilization
Throughput
Kendall's Notation
Arrival Process Notation
Service Process Notation
Number of Servers
System Capacity
Population Size
Queue Discipline
Poisson Arrival Process
Properties of Poisson Process
Interarrival Time Distribution
Memoryless Property
Birth-Death Processes
General Birth-Death Model
Steady-State Analysis
Balance Equations
Single-Server Models
M/M/1 Queue
Steady-State Probabilities
Performance Measures
System Utilization
M/G/1 Queue
Pollaczek-Khintchine Formula
Waiting Time Analysis
Multi-Server Models
M/M/s Queue
Steady-State Analysis
Performance Measures
Optimal Number of Servers
Finite Capacity Models
M/M/1/K Queue
M/M/s/K Queue
Blocking Probabilities
Loss Systems
Finite Population Models
M/M/1/N/N Queue
Machine Interference Model
Repair Shop Problems
Network of Queues
Jackson Networks
Open and Closed Networks
Product Form Solutions
Economic Analysis of Queueing Systems
Cost Components
Service Level Trade-offs
Optimal System Design
Previous
9. Stochastic Processes and Markov Chains
Go to top
Next
11. Inventory Theory