Scheduling Algorithms,Used

Scheduling Algorithms,Used

In Stock
SKU: SONG354069515X
Brand: Springer
$108.89 $155.56
Save $46.67
Quantity
Add to wishlist
Add to compare

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

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.

Recently Viewed