Complex Scheduling

Häftad, Engelska, 2013

AvPeter Brucker,Sigrid Knust

1 369 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Inbunden

1 369 kr

Skickas inom 10-15 vardagar

This book presents models and algorithms for complex scheduling problems. 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.

Produktinformation

Utgivningsdatum2013-11-27
Mått155 x 235 x 21 mm
Vikt540 g
FormatHäftad
SpråkEngelska
SerieGOR-Publications
Antal sidor342
Upplaga2
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783642269578

Tillhör följande kategorier

From the reviews of the second edition: "This book is a joint production by two veteran researchers in the field of scheduling algorithms. This second edition comes six years after the first and adds close to 60 pages of new material. Most notable is the addition of information on the resource-constrained project scheduling problem (RCPSP), which represents the major focus application of many of the techniques presented in the four sections of the book. ... This book clearly reflects the authors' efforts and is a serious treatment of the topic." (Minette Carl, ACM Computing Reviews, June, 2012)