Sprache: Englisch
Verlag: Springer Berlin Heidelberg, 2013
ISBN 10: 3642269575 ISBN 13: 9783642269578
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
EUR 94,93
Anzahl: 1 verfügbar
In den WarenkorbPAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 114,22
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Springer Berlin Heidelberg, 2013
ISBN 10: 3642269575 ISBN 13: 9783642269578
Anbieter: moluna, Greven, Deutschland
EUR 92,27
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Taschenbuch. Zustand: Neu. Complex Scheduling | Peter Brucker (u. a.) | Taschenbuch | GOR-Publications | x | Englisch | 2013 | Springer | EAN 9783642269578 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Sprache: Englisch
Verlag: Springer Berlin Heidelberg, 2013
ISBN 10: 3642269575 ISBN 13: 9783642269578
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.