Read more
This book presents models and algorithms for complex scheduling problems. Besides resource-constrained project scheduling problems with applications also job-shop problems with flexible machines, transportation or limited buffers are discussed. Discrete optimization methods like linear and integer programming, constraint propagation techniques, shortest path and network flow algorithms, branch-and-bound methods, local search and genetic algorithms, and dynamic programming are presented. They are used in exact or heuristic procedures to solve the introduced complex scheduling problems. Furthermore, methods for calculating lower bounds are described. Most algorithms are formulated in detail and illustrated with examples.
List of contents
Scheduling Models.- Algorithms and Complexity.- Resource-Constrained Project Scheduling.- Complex Job-Shop Scheduling.
Report
From the reviews: "This monograph deals with complex scheduling problems and typical solution approaches for them. This book gives a good and well readable introduction into such complex scheduling problems with a review of current solution techniques. Most algorithms for the exact and heuristic solution of the problem types considered are given in detail, and they are often illustrated with an example. The monograph can be recommended both for researchers and practitioners." (Frank Werner, Zentralblatt MATH, Vol. 1154, 2009)
