Scheduling Algorithms

Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent change over times and batching. Also multiprocessor task scheduling and problems with multi-purpose machines are discussed. The methods used to solve these problems are polynomial algorithms, dynamic programming procedures, branch-and-bound algorithms and local search heuristics. Also complexity issues are addressed. Front Matter....Pages i-x Classification of Scheduling Problems....Pages 1-10 Some Problems in Combinatorial Optimization....Pages 11-36 Computational Complexity....Pages 37-59 Single Machine Scheduling Problems....Pages 60-99 Parallel Machines....Pages 100-142 Shop Scheduling Problems....Pages 143-224 Due-Date Scheduling....Pages 225-247 Batching Problems....Pages 248-253 Changeover Times and Transportation Times....Pages 254-263 Multiprocessor Tasks....Pages 264-283 Multi-Purpose Machines....Pages 284-307 Back Matter....Pages 308-326 Contents: Classification of Scheduling Problems Some Problems in Combinatorial Optimization Computational Complexity Single Machine Scheduling Problems Parallel Machines Shop Scheduling Problems Due-Date Scheduling Batching Problems Changeover Times and Transportation Times Multiprocessor Tasks Multi-Purpose Machines.