Besides scheduling problems for single and parallel machines and shop scheduling problems, this book covers advanced models involving due-dates, sequence dependent changeover times and batching. Discussion also extends to multiprocessor task scheduling and problems with multi-purpose machines. Among the methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. The text goes on to summarize complexity results for different classes of deterministic scheduling problems.
Or split into 4x interest-free payments of 25% on orders over R50
Learn more
Besides scheduling problems for single and parallel machines and shop scheduling problems, this book covers advanced models involving due-dates, sequence dependent changeover times and batching. Discussion also extends to multiprocessor task scheduling and problems with multi-purpose machines. Among the methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. The text goes on to summarize complexity results for different classes of deterministic scheduling problems.
Imprint | Springer-Verlag |
Country of origin | Germany |
Release date | October 2010 |
Availability | Expected to ship within 10 - 15 working days |
First published | 2007 |
Authors | Peter Brucker |
Dimensions | 235 x 155 x 20mm (L x W x T) |
Format | Paperback |
Pages | 371 |
Edition | Softcover reprint of hardcover 5th ed. 2007 |
ISBN-13 | 978-3-642-08907-7 |
Barcode | 9783642089077 |
Categories | |
LSN | 3-642-08907-0 |