Scheduling Algorithms

Häftad, Engelska, 2010

AvPeter Brucker

1 829 kr

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

Finns i fler format (1)

Inbunden

1 849 kr

Skickas inom 10-15 vardagar

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. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics.

Produktinformation

Utgivningsdatum2010-10-15
Mått155 x 235 x 21 mm
Vikt581 g
FormatHäftad
SpråkEngelska
Antal sidor371
Upplaga5
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783642089077

Tillhör följande kategorier

From the reviews of the fourth edition: "This is a book about scheduling algorithms. ... The book contains eleven chapters. ... Most of the chapters contain the summarized complexity results. In this edition the complexity columns have been updated. The book is completed by the bibliography which also has been updated and now contains 198 references. The book is well organized. It will be useful for specialists in scheduling theory and in combinatorial optimization." (I.N. Lushchakova, Zentralblatt MATH, Vol. 1060, 2005) From the reviews of the fifth edition: "One of the competitive books on the theory of machine scheduling in the market, this book, now in its fifth edition, was first published in 1995. ... This book is theoretically oriented with little treatment of practical issues. It is suitable for researchers and graduate students in mathematics, computer science, operations research, management science, and industrial engineering. ... To summarize, this is an excellent theoretically oriented reference book written by an expert on the classical results of deterministic machine scheduling." (Donglei Du, SIAM Review, Vol. 50 (1), 2008)