Title
Scheduling Algorithms [electronic resource] / by Peter Brucker.
Edition
Second, Revised and Enlarged Edition.
Published
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
Physical Description
XII, 342 p. digital.
Local Notes
Access is available to the Yale community.
Access and use
Access restricted by licensing agreement.
Summary
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.
Variant and related titles
Springer ebooks.
Other formats
Printed edition:
Added to Catalog
May 16, 2013
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
Multi-Purpose Machines
Multiprocessor Tasks.
Also listed under
SpringerLink (Online service)