• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Complex Scheduling

Complex Scheduling

Hardcover

Series: Gor-Publications

Business GeneralGeneral ComputersGeneral Mathematics

ISBN10: 3642239285
ISBN13: 9783642239281
Publisher: Springer
Published: Sep 29 2011
Pages: 342
Weight: 1.47
Height: 0.81 Width: 6.14 Depth: 9.21
Language: English

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.

1 different editions

Also available

Also from

Brucker, Peter

Also in

General Mathematics