Scheduling Algorithms
By: by Peter Brucker
Edition: Fourth Edition.
Publisher: Springer Berlin Heidelberg
Published: 2004
Place of publication: Berlin, Heidelberg
Language: eng
Format: [electronic resource] /
Number of pages: 367
ISBN-13: 9783662129449; 9783540248040
Subjects: Economics; 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 method 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 updated and summarized. Also the references are updated.
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.