Scheduling Computer and Manufacturing Processes

(7)
Scheduling Computer and Manufacturing Processes image
ISBN-10:

3642075452

ISBN-13:

9783642075452

Edition: Softcover reprint of hardcover 2nd ed. 2001
Released: Dec 06, 2010
Publisher: Springer
Format: Paperback, 495 pages
Related ISBN: 9783540419310

Description:

Written in a clear and concise manner this book provides a theoretical and application oriented analysis of deterministic scheduling problems arising in computer and manufacturing environments. Various scheduling problems are discussed where different problem parameters such as task processing times, urgency weights, arrival times, deadlines, precedence constraints, and processor speed factor are involved. Polynomial and exponential time optimization algorithms as well as approximation and heuristic approaches are presented and discussed. Moreover, resource-constrained, imprecise computation, flexible flow shop and dynamic job shop scheduling, as well as flexible manufacturing systems, are considered. An excellent analysis based on real-world applications with plenty of examples.

Best prices to buy, sell, or rent ISBN 9783642075452




Frequently Asked Questions about Scheduling Computer and Manufacturing Processes

You can buy the Scheduling Computer and Manufacturing Processes book at one of 20+ online bookstores with BookScouter, the website that helps find the best deal across the web. Currently, the best offer comes from and is $ for the .

The price for the book starts from $62.55 on Amazon and is available from 12 sellers at the moment.

If you’re interested in selling back the Scheduling Computer and Manufacturing Processes book, you can always look up BookScouter for the best deal. BookScouter checks 30+ buyback vendors with a single search and gives you actual information on buyback pricing instantly.

As for the Scheduling Computer and Manufacturing Processes book, the best buyback offer comes from and is $ for the book in good condition.

Not enough insights yet.

Not enough insights yet.