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 multipurpose 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 the different classes of deterministic scheduling problems are summarized.
The book presents: algorithms for classical and complex scheduling problems new results on scheduling problems arising in flexible manufacturing an extensive overview of the area of scheduling
Peter Brucker
Scheduling Shop-Scheduling-Probleme algorithms combinatorial optimization complexity dynamic programming dynamische Programmierung heuristics linear optimization operations research optimization programming shop scheduling