Complex Scheduling (inbunden)
Format
Inbunden (Hardback)
Språk
Engelska
Serie
GOR-Publications
Antal sidor
342
Utgivningsdatum
2011-09-29
Upplaga
2
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Dimensioner
234 x 156 x 21 mm
Vikt
667 g
ISBN
9783642239281

Complex Scheduling

Inbunden,  Engelska, 2011-09-29
1095
  • Skickas från oss inom 7-10 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
Finns även som
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. In this second edition some errors were corrected, some parts were explained in more detail, and new material has been added. In particular, further generalizations of the RCPSP, additional practical applications and some more algorithms were integrated.

Passar bra ihop

  1. Complex Scheduling
  2. +
  3. The Art and Making of Arcane

De som köpt den här boken har ofta också köpt The Art and Making of Arcane av Elisabeth Vincentelli, Insight Editions (inbunden).

Köp båda 2 för 1590 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av författarna

  • Scheduling Algorithms

    Peter Brucker

    Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with ...