Title
Scheduling Algorithms,Used
Delivery time: 8-12 business days (International)
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.
By changing our most important processes and
products, we have already made a big leap forward. This ranges from the
increased use of more sustainable fibers to the use of more
environmentally friendly printing processes to the development of
efficient waste management in our value chain.
⚠️ 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.
Shipping & Returns
Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.
Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.
Shipping & Returns
Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.
Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.
Warranty
We provide a 2-year limited warranty, from the date of purchase for all our products.
If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.
This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).
Warranty
We provide a 2-year limited warranty, from the date of purchase for all our products.
If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.
This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).
Secure Payment
Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.
We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.
Secure Payment
Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.
We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.
Related Products
You may also like
Frequently Asked Questions
- 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.