Scheduling algorithms

More about the book

The book contains algorithms for classical and complex scheduling problems, new results on scheduling problems arising in flexible manufacturing, and an extensive overview of the area of scheduling. The methods used to solve these problems include: linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. In the third edition of the book the complexity status of the different classes of scheduling problems has been updated. New polynomial algorithms for single machine problems with release times and constant processing times have been added.