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 multi-purpose 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 different classes of deterministic scheduling problems are summerized. © Springer-Verlag Berlin Heidelberg 2007. All rights are reserved.
CITATION STYLE
Brucker, P. (2007). Scheduling algorithms. Scheduling Algorithms (pp. 1–371). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-69516-5
Mendeley helps you to discover research relevant for your work.