
Scheduling Algorithms
Peter Brucker(Author)
Springer (Publisher)
Published on 18. September 1995
Book
Hardback
X, 326 pages
978-3-540-60087-9 (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 change-over times and batching. A discussion of multiprocessor task scheduling and problems with multi-purpose machines is accompanied by the methods used to solve such problems, such as polynomial algorithms, dynamic programming procedures, branch-and-bound algorithms and local search heuristics, and the whole is rounded off with an analysis of complexity issues.
More details
Language
English
Place of publication
Heidelberg
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Illustrations
17
17 s/w Tabellen
75figs.17tabs.
Dimensions
Height: 23.5 cm
Width: 15.5 cm
Weight
620 gr
ISBN-13
978-3-540-60087-9 (9783540600879)
DOI
10.1007/978-3-662-03088-2
Schweitzer Classification
Other editions
New editions

Peter Brucker
Scheduling Algorithms
Book
04/1998
2nd Edition
Springer
€85.59
Article exhausted; check for reprint
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 Multiprocessor Tasks.- 11 Multi-Purpose Machines.- References.