Scheduling Algorithms
Scheduling Algorithms
Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multi-purpose machines are discussed. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for different classes of deterministic scheduling problems are summerized.
Classification of Scheduling Problems
Classification of Scheduling Problems
- Some Problems in Combinatorial Optimization
- Computational Complexity
- Single Machine Scheduling Problems
- Parallel Machines
- Shop Scheduling Problems
- Due-Date Scheduling
- Batching Problems
- Changeover Times and Transportation Times
- Multi-Purpose Machines
- Multiprocessor Tasks.
Brucker, Peter
| ISBN | 978-3-540-69515-8 |
|---|---|
| Article number | 9783540695158 |
| Media type | Book |
| Edition number | 5th ed. |
| Copyright year | 2007 |
| Publisher | Springer, Berlin |
| Length | XII, 371 pages |
| Illustrations | XII, 371 p. 77 illus. |
| Language | English |
