Title
Scheduling Algorithms,Used
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving duedates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multipurpose machines are discussed. The methods used to solve these problems are linear programming, dynamic programming, branchandbound algorithms, and local search heuristics. Complexity results for different classes of deterministic scheduling problems are summerized.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What topics are covered in 'Scheduling Algorithms'? A: 'Scheduling Algorithms' covers a range of topics including single and parallel machine scheduling problems, shop scheduling, advanced models with due dates, sequence-dependent changeover times, batching, multiprocessor task scheduling, and issues with multi-purpose machines.
- Q: Who is the author of 'Scheduling Algorithms'? A: The author of 'Scheduling Algorithms' is Peter Brucker.
- Q: What is the publication date of 'Scheduling Algorithms'? A: 'Scheduling Algorithms' was published on February 6, 2007.
- Q: What is the total number of pages in 'Scheduling Algorithms'? A: 'Scheduling Algorithms' contains a total of 383 pages.
- Q: What edition of 'Scheduling Algorithms' is available? A: The available edition of 'Scheduling Algorithms' is the 5th edition, published in 2007.
- Q: Is 'Scheduling Algorithms' available in hardcover? A: Yes, 'Scheduling Algorithms' is available in hardcover binding.
- Q: What methods are discussed in the book for solving scheduling problems? A: 'Scheduling Algorithms' discusses various methods for solving scheduling problems, including linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics.
- Q: What is the condition of the book 'Scheduling Algorithms'? A: 'Scheduling Algorithms' is in new condition.
- Q: What categories does 'Scheduling Algorithms' fall under? A: 'Scheduling Algorithms' falls under the category of Management Science.
- Q: Does 'Scheduling Algorithms' include complexity results for scheduling problems? A: Yes, the book summarizes complexity results for different classes of deterministic scheduling problems.