Photo 1/1
Galerie
Photo 1/1
Vous en avez un à vendre ?
Scheduling Algorithms by Peter Brucker: New
155,72 USD
Environ132,62 EUR
État :
Neuf
Livre neuf, n'ayant jamais été lu ni utilisé, en parfait état, sans pages manquantes ni endommagées. Consulter l'annonce du vendeur pour avoir plus de détails.
- Achat immédiatScheduling Algorithms by Peter Brucker: New
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Livraison :
Gratuit Standard Shipping.
Lieu où se trouve l'objet : Sparks, Nevada, États-Unis
Délai de livraison :
Estimé entre le jeu. 31 juil. et le mer. 6 août à 94104
Retours :
Retour sous 30 jours. L'acheteur paie les frais de retour. Si vous utilisez un bordereau d'affranchissement eBay, son coût sera déduit du montant de votre remboursement.
Paiements :
Achetez en toute confiance
Le vendeur assume l'entière responsabilité de cette annonce.
Numéro de l'objet eBay :285045406987
Dernière mise à jour le 03 avr. 2024 14:55:39 CEST. Afficher toutes les modificationsAfficher toutes les modifications
Caractéristiques de l'objet
- État
- Book Title
- Scheduling Algorithms
- Publication Date
- 2007-02-06
- Edition Number
- 5
- Pages
- 371
- ISBN
- 9783540695158
À propos de ce produit
Product Identifiers
Publisher
Springer Berlin / Heidelberg
ISBN-10
354069515X
ISBN-13
9783540695158
eBay Product ID (ePID)
28038700827
Product Key Features
Number of Pages
Xii, 371 Pages
Language
English
Publication Name
Scheduling Algorithms
Subject
Programming / Algorithms, Industrial Management, Operations Research, Management Science, Data Processing, Production & Operations Management
Publication Year
2007
Features
Revised
Type
Textbook
Subject Area
Computers, Business & Economics
Format
Hardcover
Dimensions
Item Height
0.4 in
Item Weight
27.2 Oz
Item Length
9.3 in
Item Width
6.1 in
Additional Product Features
Edition Number
5
Intended Audience
Scholarly & Professional
LCCN
2006-940721
Dewey Edition
22
Reviews
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), 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 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)
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
658.5/3
Table Of Content
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.
Edition Description
Revised edition
Synopsis
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., 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.
LC Classification Number
T57.6-.97
Description de l'objet fournie par le vendeur
Informations sur le vendeur professionnel
À propos de ce vendeur
AlibrisBooks
98,6% d'évaluations positives•1,9 millions objets vendus
Inscrit comme vendeur professionnel
Évaluations du vendeur (512.953)
- s***t (3)- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéfast shipping perfect new condition!
- b***r (5620)- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéExcellent transaction!!!
- -***s (147)- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéItem as described and quickly shipped
AlibrisBooks
98,6% d'évaluations positives•1,9 millions objets vendus
Inscrit comme vendeur professionnel
Évaluations du vendeur (512.953)
- s***t (3)- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéfast shipping perfect new condition!
- b***r (5620)- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéExcellent transaction!!!
- -***s (147)- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéItem as described and quickly shipped