Brucker P. Scheduling Algorithms

Springer, 2007. — 379 p.This is a book about scheduling algorithms. The first such algorithms were formulated in the mid fifties. Since then there has been a growing interest in scheduling. During the seventies, computer scientists discovered scheduling as a tool for improving the performance of computer systems. Furthermore, scheduling problems have been investigated and classified with respect to their computational complexity. During the last few years, new and interesting scheduling problems have been formulated in connection with flexible manufacturing.
Most parts of the book are devoted to the discussion of polynomial algorithms. In addition, enumerative procedures based on branch & bound concepts and dynamic programming, as well as local search algorithms, are presented.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