Complex scheduling de brucker peter (26 resultados)

Condición: New.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New. In English.

Condición: New. pp. 352 2nd Edition.

Condición: New. In English.

Condición: New.

Condición: New.

Condición: New. pp. 352 2nd Edition.

Taschenbuch. 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.…

Buch. 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.…

Taschenbuch. Condición: Neu. 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.…

Condición: New. A brand new book in pristine condition. Showing zero signs of shelf wear, creases, or damage.

Condición: Sehr gut. Zustand: Sehr gut | Seiten: 294 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: new. Questo è un articolo print on demand.

Condición: new. Questo è un articolo print on demand.

Condició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.

Condición: New. PRINT ON DEMAND pp. 352.

Paperback. Condición: Brand New. 2nd reprint edition. 352 pages. 9.00x6.00x0.75 inches. In Stock. This item is printed on demand.

Condición: New. Print on Demand pp. 352 115 Illus.

Condición: New. PRINT ON DEMAND pp. 352.

Buch. 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 KG, Sachsenplatz 4-6, 1201 Wien 352 pp. Englisch.…