. .
Deutsch
Schweiz
Ähnliche Bücher
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Suchtools
Anmelden

Anmelden mit Facebook:

Registrieren
Passwort vergessen?


Such-Historie
Merkliste
Links zu eurobuch.ch

Dieses Buch teilen auf…
..?
Buchtipps
Aktuelles
Tipp von eurobuch.ch
Werbung
Bezahlte Anzeige
FILTER
- 0 Ergebnisse
Kleinster Preis: 59.00 EUR, größter Preis: 60.71 EUR, Mittelwert: 59.57 EUR
Scheduling Unrelated Parallel Machines - Wotzlaw, Andreas
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Wotzlaw, Andreas:

Scheduling Unrelated Parallel Machines - Taschenbuch

2007, ISBN: 3836446480, Lieferbar binnen 4-6 Wochen Versandkosten:Versandkostenfrei innerhalb der BRD

ID: 9783836446488

Internationaler Buchtitel. In englischer Sprache. Verlag: VDM Verlag, Paperback, 144 Seiten, L=240mm, B=170mm, H=9mm, Gew.=280gr, [GR: 17390 - HC/Medienwissenschaften/Sonstiges], Kartoniert/Broschiert, Klappentext: A bank of parallel machines is an important setting in computer science. When dealing with parallel machines, the minimization of the maximal load (makespan) becomes an objective of significant interest. In practice one often has to balance the load on parallel machines, e.g., on computer processors. By minimizing the makespan an excellent load balance can be ensured. The book considers the problem of scheduling independent jobs on unrelated parallel machines without preemption. The problem belongs to the most difficult problems of theoretical computer science. The first part gives an introduction to the scheduling theory. Next nine new methods designed to solve the scheduling problem are introduced. The algorithms proposed here use various algorithmic techniques like network flows, linear programming, column generation, branch-and-price, cutting planes, or randomized rounding. The last part presents a comprehensive evaluation of eighteen methods, new and old ones, using algorithmic approaches discussed earlier. The book is addressed to all interested in new results in the scheduling theory, especially to computer scientists, operations research analysts, and industrial engineers. A bank of parallel machines is an important setting in computer science. When dealing with parallel machines, the minimization of the maximal load (makespan) becomes an objective of significant interest. In practice one often has to balance the load on parallel machines, e.g., on computer processors. By minimizing the makespan an excellent load balance can be ensured. The book considers the problem of scheduling independent jobs on unrelated parallel machines without preemption. The problem belongs to the most difficult problems of theoretical computer science. The first part gives an introduction to the scheduling theory. Next nine new methods designed to solve the scheduling problem are introduced. The algorithms proposed here use various algorithmic techniques like network flows, linear programming, column generation, branch-and-price, cutting planes, or randomized rounding. The last part presents a comprehensive evaluation of eighteen methods, new and old ones, using algorithmic approaches discussed earlier. The book is addressed to all interested in new results in the scheduling theory, especially to computer scientists, operations research analysts, and industrial engineers.

Neues Buch DEU
Buchgeier.com
Lieferbar binnen 4-6 Wochen (Besorgungstitel) Versandkosten:Versandkostenfrei innerhalb der BRD
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Scheduling Unrelated Parallel Machines- Algorithms, Complexity, And Performance - Andreas Wotzlaw
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)

Andreas Wotzlaw:

Scheduling Unrelated Parallel Machines- Algorithms, Complexity, And Performance - neues Buch

ISBN: 9783836446488

Andreas Wotzlaw,Paperback, English-language edition,Pub by VDM Verlag Dr. Mueller e.K. Books Books ~~ Computers~~ General Scheduling-Unrelated-Parallel-Machines-Algorithms-Complexity-And-Performance~~Andreas-Wotzlaw VDM Verlag Dr. Mueller e.K. A bank of parallel machines is an important setting in computer science. When dealing with parallel machines, the minimization of the maximal load (makespan) becomes an objective of significant interest. In practice one often has to balance the load on parallel machines, e.g., on computer processors. By minimizing the makespan an excellent load balance can be ensured. The book considers the problem of scheduling independent jobs on unrelated parallel machines without preemption. The problem belongs to the most difficult problems of theoretical computer science. The first part gives an introduction to the scheduling theory. Next nine new methods designed to solve the scheduling problem are introduced. The algorithms proposed here use various algorithmic techniques like network flows, linear programming, column generation, branch-and-price, cutting planes, or randomized rounding. The last part presents a comprehensive evaluation of eighteen methods, new and old ones, using algorithmic approaches discussed earlier. The book is addressed to all interested in new results in the scheduling theory, especially to computer scientists, operations research analysts, and industrial engineers.

Neues Buch [USA] Barnesandnoble.com
Free Shipping on eligible orders over $25 Versandkosten:zzgl. Versandkosten
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Scheduling Unrelated Parallel Machines - Wotzlaw, Andreas
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Wotzlaw, Andreas:
Scheduling Unrelated Parallel Machines - signiertes Exemplar

2007

ISBN: 3836446480

Lieferbar binnen 4-6 Wochen

Taschenbuch, ID: 9783836446488

Internationaler Buchtitel. In englischer Sprache. Verlag: VDM Verlag, Paperback, 144 Seiten, L=240mm, B=170mm, H=9mm, Gew.=280gr, [GR: 17390 - HC/Medienwissenschaften/Sonstiges], Kartoniert/Broschiert, Klappentext: A bank of parallel machines is an important setting in computer science. When dealing with parallel machines, the minimization of the maximal load (makespan) becomes an objective of significant interest. In practice one often has to balance the load on parallel machines, e.g., on computer processors. By minimizing the makespan an excellent load balance can be ensured. The book considers the problem of scheduling independent jobs on unrelated parallel machines without preemption. The problem belongs to the most difficult problems of theoretical computer science. The first part gives an introduction to the scheduling theory. Next nine new methods designed to solve the scheduling problem are introduced. The algorithms proposed here use various algorithmic techniques like network flows, linear programming, column generation, branch-and-price, cutting planes, or randomized rounding. The last part presents a comprehensive evaluation of eighteen methods, new and old ones, using algorithmic approaches discussed earlier. The book is addressed to all interested in new results in the scheduling theory, especially to computer scientists, operations research analysts, and industrial engineers.

Neues Buch eurobuch.neubuch
Bides.de
Lieferbar binnen 4-6 Wochen (Besorgungstitel)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.

< zum Suchergebnis...
Details zum Buch
Scheduling Unrelated Parallel Machines
Autor:

Wotzlaw, Andreas

Titel:

Scheduling Unrelated Parallel Machines

ISBN-Nummer:

9783836446488

A bank of parallel machines is an important setting in computer science. When dealing with parallel machines, the minimization of the maximal load (makespan) becomes an objective of significant interest. In practice one often has to balance the load on parallel machines, e.g., on computer processors. By minimizing the makespan an excellent load balance can be ensured. The book considers the problem of scheduling independent jobs on unrelated parallel machines without preemption. The problem belongs to the most difficult problems of theoretical computer science. The first part gives an introduction to the scheduling theory. Next nine new methods designed to solve the scheduling problem are introduced. The algorithms proposed here use various algorithmic techniques like network flows, linear programming, column generation, branch-and-price, cutting planes, or randomized rounding. The last part presents a comprehensive evaluation of eighteen methods, new and old ones, using algorithmic approaches discussed earlier. The book is addressed to all interested in new results in the scheduling theory, especially to computer scientists, operations research analysts, and industrial engineers.

Detailangaben zum Buch - Scheduling Unrelated Parallel Machines


EAN (ISBN-13): 9783836446488
ISBN (ISBN-10): 3836446480
Taschenbuch
Erscheinungsjahr: 2007
Herausgeber: VDM Verlag
144 Seiten
Gewicht: 0,280 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 19.03.2008 15:47:24
Buch zuletzt gefunden am 10.10.2014 10:57:52
ISBN/EAN: 9783836446488

ISBN - alternative Schreibweisen:
3-8364-4648-0, 978-3-8364-4648-8

< zum Suchergebnis...
< zum Archiv...
Benachbarte Bücher