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
Fundamentals of Scheduling
Introduction to Scheduling
Definition and Scope
Relationship to Queueing Theory
Decision Variables
Constraints
Scheduling Objectives
Completion Time Criteria
Makespan
Total Completion Time
Mean Flow Time
Due Date Criteria
Maximum Lateness
Total Tardiness
Number of Tardy Jobs
Inventory and Cost Criteria
Holding Costs
Setup Costs
Penalty Costs
Fairness Criteria
Variance of Completion Times
Range of Completion Times
Multi-Objective Scheduling
Problem Classification
Machine Environment
Single Machine
Parallel Machines
Flow Shop
Job Shop
Open Shop
Job Characteristics
Processing Times
Release Times
Due Dates
Precedence Constraints
Scheduling Constraints
Preemption
Setup Times
Resource Constraints
Information Availability
Static vs Dynamic
Deterministic vs Stochastic
Online vs Offline
Graham's Notation
Machine Environment (α)
Job Characteristics (β)
Optimality Criterion (γ)
Common Problem Types
Previous
5. Queueing Networks
Go to top
Next
7. Single Machine Scheduling