EUR 96,16
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 98,53
Cantidad disponible: 1 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
EUR 95,07
Cantidad disponible: 1 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
EUR 109,09
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 94,66
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 111,82
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 115,74
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 132,73
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 352 2nd Edition.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, Springer Nov 2013, 2013
ISBN 10: 3642269575 ISBN 13: 9783642269578
Librería: Wegmann1855, Zwiesel, Alemania
EUR 106,99
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware -This book presents models and algorithms forcomplex 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.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2013
ISBN 10: 3642269575 ISBN 13: 9783642269578
Librería: moluna, Greven, Alemania
EUR 92,27
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
EUR 93,80
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2013
ISBN 10: 3642269575 ISBN 13: 9783642269578
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 106,99
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 86,24
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, Springer Nov 2013, 2013
ISBN 10: 3642269575 ISBN 13: 9783642269578
Librería: Rheinberg-Buch Andreas Meier eK, Bergisch Gladbach, Alemania
EUR 106,99
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 352 pp. Englisch.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, Springer Nov 2013, 2013
ISBN 10: 3642269575 ISBN 13: 9783642269578
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 106,99
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 352 pp. Englisch.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 134,17
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 352 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 136,69
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 352.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 138,93
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Brand New. 2nd reprint edition. 352 pages. 9.00x6.00x0.75 inches. In Stock. This item is printed on demand.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2013, 2013
ISBN 10: 3642269575 ISBN 13: 9783642269578
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 106,99
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book presents models and algorithms forcomplex 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 352 pp. Englisch.