Scheduling Algorithms

Front Cover
Springer Science & Business Media, Apr 17, 2013 - Business & Economics - 326 pages
0 Reviews
Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent change over times and batching. Also multiprocessor task scheduling and problems with multi-purpose machines are discussed. The methods used to solve these problems are polynomial algorithms, dynamic programming procedures, branch-and-bound algorithms and local search heuristics. Also complexity issues are addressed.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Preface
1
Some Problems in Combinatorial Optimization
11
Computational Complexity
37
Single Machine Scheduling Problems
60
Parallel Machines
100
Shop Scheduling Problems
143
DueDate Scheduling
225
Batching Problems
248
Changeover Times and Transportation Times
254
Multiprocessor Tasks
264
MultiPurpose Machines
284
References
308
Index
322
Copyright

Other editions - View all

Common terms and phrases