Scheduling Unrelated Parallel Machines
Algorithms, Complexity, and Performance
(Sprache: Englisch)
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 oftenhas to balance the load on...
Leider schon ausverkauft
versandkostenfrei
Buch
59.00 €
Produktdetails
Produktinformationen zu „Scheduling Unrelated Parallel Machines “
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.
Klappentext zu „Scheduling Unrelated Parallel Machines “
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.
Autoren-Porträt von Andreas Wotzlaw
Dr. Andreas Wotzlaw: Studied Computer Scienceat the Silesian University of Technology in Gliwice,Poland. Obtained in 2006 his PhD in ComputerScience from the University of Paderborn,Germany. Works in Bonn, Germany as a seniorscientist on research projects concerningarchitecture and optimization of large serviceorientedinformation systems.
Bibliographische Angaben
- Autor: Andreas Wotzlaw
- 2007, 144 Seiten, Maße: 17 x 24 cm, Kartoniert (TB), Englisch
- Verlag: VDM Verlag Dr. Müller
- ISBN-10: 3836446480
- ISBN-13: 9783836446488
Sprache:
Englisch
Kommentar zu "Scheduling Unrelated Parallel Machines"
0 Gebrauchte Artikel zu „Scheduling Unrelated Parallel Machines“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Scheduling Unrelated Parallel Machines".
Kommentar verfassen