UsefulLinks
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
9.
Flow Shop and Job Shop Scheduling
9.1.
Flow Shop Scheduling
9.1.1.
Two-Machine Flow Shop
9.1.1.1.
Johnson's Algorithm
9.1.1.2.
Optimality Proof
9.1.2.
Three-Machine Flow Shop
9.1.2.1.
Heuristic Methods
9.1.2.2.
Complexity Results
9.1.3.
General Flow Shop
9.1.3.1.
NEH Heuristic
9.1.3.2.
Branch and Bound
9.1.3.3.
Metaheuristics
9.2.
Job Shop Scheduling
9.2.1.
Problem Formulation
9.2.2.
Disjunctive Graph Model
9.2.3.
Critical Path Analysis
9.2.4.
Shifting Bottleneck Heuristic
9.2.5.
Branch and Bound Methods
9.2.6.
Local Search Methods
Previous
8. Parallel Machine Scheduling
Go to top
Next
10. Real-Time Scheduling