Scheduling Algorithms (Hardback)Peter Brucker
Hardback Published: 29/04/1998
- Not available
Besides scheduling problems for single and parallel machines and shop scheduling problems, this study covers advanced models involving due-dates, sequence-dependent changeover times and batching. It also discusses multiprocessor task scheduling and problems with multipurpose machines. The methods used to solve these problems are linear programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are summarized.
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
You may also be interested in...
Mixed media product
Simply reserve online and pay at the counter when you collect. Available in shop from just two hours, subject to availability.
Thank you for your reservation
Your order is now being processed and we have sent a confirmation email to you at
When will my order be ready to collect?
Following the initial email, you will be contacted by the shop to confirm that your item is available for collection.
Call us on or send us an email at
Unfortunately there has been a problem with your order
Please try again or alternatively you can contact your chosen shop on or send us an email at