{
"item_title" : "Scheduling Algorithms",
"item_author" : [" Peter Brucker "],
"item_description" : "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.",
"item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/54/069/515/354069515X_b.jpg",
"price_data" : {
"retail_price" : "139.99", "online_price" : "139.99", "our_price" : "139.99", "club_price" : "139.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Scheduling Algorithms
Other Available Formats
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783540695158
- ISBN-10: 354069515X
- Publisher: Springer
- Publish Date: February 2007
- Dimensions: 9.2 x 6.3 x 1 inches
- Shipping Weight: 1.5 pounds
- Page Count: 371
Related Categories
