Scheduling Algorithms
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.
- Hardcover: 383 pages
- Publisher: Springer; 5th edition (March 12, 2007)
- Language: English
- ISBN-10: 354069515X
- ISBN-13: 978-3540695158
- Format : PDF
- Size : 12.5 mb
Download : Scheduling Algorithms | Mirror
If you enjoyed this post, please consider to leave a comment or subscribe to the feed and get future articles delivered to your feed reader.

Comments
No comments yet.
Leave a comment