Springer

Scheduling Algorithms

Free shipping with 3 or more products in your cart
Payflex: Pay in 4 interest-free payments of R676.25. Read the FAQ
R 2,705
In stock
Low stock in USA warehouse Order soon to secure your order
Used, Good Condition
Duties, insurance and VAT included
Delivered in 10–20 working days —
Free shipping with 3 or more products in your cart
Secure checkout
Your payment is fully protected
Duties & VAT included
No surprise charges at the door
Tracked delivery
Track your order end to end
Returns support
30-day return window

Description

Condition - Very Good

The item shows wear from consistent use but remains in good condition. It may arrive with damaged packaging or be repackaged.

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.

Shipping & Delivery

Your order is shipped from the USA and delivered to your door in South Africa in 10–20 working days. All items are fully tracked.

Returns & Exchanges

We offer a 30-day return window. If something isn't right, contact our support team and we'll make it right.