Scheduling Algorithms
Autor Peter Bruckeren Limba Engleză Paperback – 15 oct 2010
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 769.35 lei 43-57 zile | |
| Springer Berlin, Heidelberg – 15 oct 2010 | 769.35 lei 43-57 zile | |
| Hardback (1) | 774.29 lei 43-57 zile | |
| Springer Berlin, Heidelberg – 6 feb 2007 | 774.29 lei 43-57 zile |
Preț: 769.35 lei
Preț vechi: 938.23 lei
-18% Nou
Puncte Express: 1154
Preț estimativ în valută:
147.24€ • 152.94$ • 122.30£
147.24€ • 152.94$ • 122.30£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642089077
ISBN-10: 3642089070
Pagini: 384
Ilustrații: XII, 371 p. 77 illus.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:Softcover reprint of hardcover 5th ed. 2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642089070
Pagini: 384
Ilustrații: XII, 371 p. 77 illus.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:Softcover reprint of hardcover 5th ed. 2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
-8%Preț: 418.23 lei454.60 lei -
Statistical Methods for Business and EconomicsGert Nieuwenhuis-22%Preț: 349.90 lei450.90 lei -
Business Research MethodsBoris Blumberg-8%Preț: 413.04 lei448.96 lei -
-15%Preț: 635.95 lei748.18 lei -
Making Negotiations Predictable: What Science Tells UsDavid De CremerPreț: 413.46 lei -
-18%Preț: 713.24 lei869.81 lei -
Managing Service Operations: Design and ImplementationWilliam J Hollins-19%Preț: 510.03 lei629.66 lei -
Introduction to Stochastic ProgrammingJohn R. Birge-15%Preț: 596.19 lei701.40 lei -
Preț: 128.04 lei -
Newton-Type Methods for Optimization and Variational ProblemsAlexey F. Izmailov-18%Preț: 785.43 lei957.84 lei -
Integer ProgrammingMichele ConfortiPreț: 488.65 lei
Public țintă
ResearchCuprins
Classification of Scheduling Problems.- Some Problems in Combinatorial Optimization.- Computational Complexity.- Single Machine Scheduling Problems.- Parallel Machines.- Shop Scheduling Problems.- Due-Date Scheduling.- Batching Problems.- Changeover Times and Transportation Times.- Multi-Purpose Machines.- Multiprocessor Tasks.
Recenzii
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)
"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)
Textul de pe ultima copertă
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. Also multiprocessor task scheduling and problems with multi-purpose machines are discussed. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for different classes of deterministic scheduling problems are summerized.
Caracteristici
This book is meanwhile a standard text for its subject Includes supplementary material: sn.pub/extras