Scheduling Algorithms (2nd revised & enlarged ed)

Besides scheduling problems for single and parallel machines and shop scheduling problems, this study covers advanced models involving due-dates, sequence-dependent changeover times and batching.

It also discusses multiprocessor task scheduling and problems with multipurpose machines.

The methods used to solve these problems are linear programming, branch-and-bound algorithms, and local search heuristics.

Complexity results for the different classes of deterministic scheduling problems are summarized.