Peter Brucker – författare

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. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics.

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. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics.

This book presents models and algorithms for complex scheduling problems. Discrete optimization methods like linear and integer programming, constraint propagation techniques, shortest path and network flow algorithms, branch-and-bound methods, local search and genetic algorithms, and dynamic programming are presented.