Besides scheduling problems for single and parallel machines and shop scheduling problems, this book covers advanced models involving due-dates, sequence dependent changeover times and batching. Discussion also extends to multiprocessor task scheduling and problems with multi-purpose machines. Among the methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. The text goes on to summarize complexity results for different classes of deterministic scheduling problems.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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)
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Spese di spedizione:
GRATIS
In U.S.A.
Descrizione libro Condizione: New. Book is in NEW condition. Codice articolo 3642089070-2-1
Descrizione libro Condizione: New. New! This book is in the same immaculate condition as when it was published. Codice articolo 353-3642089070-new
Descrizione libro Soft Cover. Condizione: new. Codice articolo 9783642089077
Descrizione libro Condizione: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Codice articolo ria9783642089077_lsuk
Descrizione libro Condizione: New. Codice articolo ABLIING23Mar3113020217435
Descrizione libro Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 384 pp. Englisch. Codice articolo 9783642089077
Descrizione libro Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book is meanwhile a standard text for its subjectBesides 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. Codice articolo 5047933
Descrizione libro Condizione: New. Codice articolo I-9783642089077
Descrizione libro Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9783642089077
Descrizione libro Paperback. Condizione: Brand New. 5th ed. edition. 371 pages. 9.00x6.00x0.87 inches. In Stock. Codice articolo x-3642089070