Scheduling Algorithms

✍ Scribed by Professor Dr. Peter Brucker (auth.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2007
• Tongue: English
• Leaves: 378
• Edition: 5
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Front Matter....Pages i-xii
Classification of Scheduling Problems....Pages 1-10
Some Problems in Combinatorial Optimization....Pages 11-36
Computational Complexity....Pages 37-60
Single Machine Scheduling Problems....Pages 61-106
Parallel Machines....Pages 107-154
Shop Scheduling Problems....Pages 155-241
Due-Date Scheduling....Pages 243-265
Batching Problems....Pages 267-280
Changeover Times and Transportation Times....Pages 281-291
Multi-Purpose Machines....Pages 293-316
Multiprocessor Tasks....Pages 317-345
Back Matter....Pages 347-371

✦ Subjects

Operations Research/Decision Theory; Operations Research, Mathematical Programming; Production/Logistics