Scheduling Algorithms Hardback - 2007
by Peter Brucker
- Used
- Hardback
A$73.94
A$6.21
Delivery within USA
Standard delivery: 4 to 14 days
More delivery options
Standard delivery: 4 to 14 days
Details
- Title Scheduling Algorithms
- Author Peter Brucker
- Binding Hardback
- Edition [ Edition: fifth ]
- Condition Used - Good Condition
- Pages 371
- Volumes 1
- Language ENG
- Publisher Springer
- Publication date 2007-02-06
- Features Bibliography, Index, Table of Contents
- Bookseller's Inventory # 6837255
- ISBN 9783540695158 / 354069515X
- Weight 1.5 lbs (0.68 kg)
- Dimensions 9.2 x 6.3 x 1 in (23.37 x 16.00 x 2.54 cm)
- Category Business / Economics / Finance
- Library of Congress Catalogue Number 2006940721
- Dewey Decimal Code 658.530
- Quantity available 1
About BookHolders Virginia, United States
Biblio member since 2004
Cheap Books.
bookholders.com30 Day Return Policy.
Reader reviews for Scheduling Algorithms
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
From the rear cover
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 multi-purpose 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 different classes of deterministic scheduling problems are summerized.