
Scheduling Algorithms
Peter Brucker(Author)
Springer (Publisher)
2nd Edition
Published on 16. April 1998
Book
Hardback
XII, 342 pages
978-3-540-64105-6 (ISBN)
Article exhausted; check for reprint
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.
More details
Edition
2nd, rev. and enlarged ed.
Language
English
Place of publication
Heidelberg
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Illustrations
18 s/w Tabellen
76 figures, 18 tables
Dimensions
Height: 23.5 cm
Width: 15.5 cm
Weight
660 gr
ISBN-13
978-3-540-64105-6 (9783540641056)
DOI
10.1007/978-3-662-03612-9
Schweitzer Classification
Other editions
New editions

Peter Brucker
Scheduling Algorithms
Book
06/2001
3rd Edition
Springer
€85.59
Article exhausted; check for reprint
Previous edition

Content
1 Classification of Scheduling Problems.- 2 Some Problems in Combinatorial Optimization.- 3 Computational Complexity.- 4 Single Machine Scheduling Problems.- 5 Parallel Machines.- 6 Shop Scheduling Problems.- 7 Due-Date Scheduling.- 8 Batching Problems.- 9 Changeover Times and Transportation Times.- 10 Multi-Purpose Machines.- 11 Multiprocessor Tasks.- References.