Scheduling Algorithms
By: by Peter Brucker
Edition: Third Edition.
Publisher: Springer Berlin Heidelberg
Published: 2001
Place of publication: Berlin, Heidelberg
Language: eng
Format: [electronic resource] /
Number of pages: 365
ISBN-13: 9783662045527; 9783662045503
Subjects: Engineering; Economics; Mathematical optimization; Computer network architectures; Physics; Operations research
Description: 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. In the third edition of the book the complexity status of the different classes of scheduling problems is updated and corresponding references are added. New polynomial algorithms for single machine problems with release times and constant processing times are added.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.
Table of contents: title: Classification of Scheduling Problems; title: Some Problems in Combinatorial Optimization; title: Computational Complexity; title: Single Machine Scheduling Problems; title: Parallel Machines; title: Shop Scheduling Problems; title: Due-Date Scheduling; title: Batching Problems; title: Changeover Times and Transportation Times; title: Multi-Purpose Machines; title: Multiprocessor Tasks.