RechèchLaLiv (alias DieBuchSuche) - motè rechèch pou tout liv.
Nou ta renmen wè nan plis pase 100 boutik pou ou pi bon kalite òf - Tanpri datant…
- Pwi transpò yo pou Ayiti (motifye pou USA, FRA, GTM, HTI, DEU)
Kreye prédéfini

Tout liv pou 9783639425710 - konpare òf chak

Achiv yo antre:
9783639425710 - Wotzlaw, Andreas: Scheduling Unrelated Parallel Machines: Algorithms, Complexity, and Performance - Liv

(?):

Scheduling Unrelated Parallel Machines Algorithms Complexity and Performance (2012) (?)

Livrezon nan: AlmayLiv AlmanSa se yon paperback livNouvo livréimprimer
ISBN:

9783639425710 (?) ni ni 3639425715

, an Alman, AV Akademikerverlag, Paperback, Nouvo, réimprimer
This item is printed on demand for shipment within 3 working days.
Soti nan 10/19/2014 01:55h
ISBN (altènatif notations): 3-639-42571-5, 978-3-639-42571-0
Achiv yo antre:
9783639425710 - Wotzlaw, Andreas: Scheduling Unrelated Parallel Machines - Liv

(?):

Scheduling Unrelated Parallel Machines (?)

Livrezon nan: AlmayLiv AlmanSa se yon paperback livNouvo liv
ISBN:

9783639425710 (?) ni ni 3639425715

, an Alman, Av Akademikerverlag, Paperback, Nouvo
Lib anbakman
Revision with unchanged content. 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.144 S. 220 mmVersandfertig in 3-5 Tagen, Softcover
Plis…
Soti nan 10/19/2014 01:55h
ISBN (altènatif notations): 3-639-42571-5, 978-3-639-42571-0
Achiv yo antre:
9783639425710 - Wotzlaw, Andreas: Scheduling Unrelated Parallel Machines - Liv

(?):

Scheduling Unrelated Parallel Machines (?)

Livrezon nan: AlmayLiv AlmanNouvo liv
ISBN:

9783639425710 (?) ni ni 3639425715

, an Alman, VDM Verlag Dr. Müller, Saarbrücken, Germany, Nouvo
plis anbakman, Sofort lieferbar
Algorithms, Complexity, and Performance, Algorithms, Complexity, and Performance
Kategori: Bücher > English, International > Gebundene Ausgaben
Soti nan 10/19/2014 01:55h
ISBN (altènatif notations): 3-639-42571-5, 978-3-639-42571-0
Achiv yo antre:
9783639425710 - Wotzlaw, Andreas: Scheduling Unrelated Parallel Machines - Liv

(?):

Scheduling Unrelated Parallel Machines (?)

Livrezon nan: AlmayLiv AlmanSa se yon paperback livNouvo liv
ISBN:

9783639425710 (?) ni ni 3639425715

, an Alman, Av Akademikerverlag, Paperback, Nouvo
Lib anbakman
Revision with unchanged content. 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.144 S. 220 mmVersandfertig in 3-5 Tagen, Softcover
Plis…
Soti nan 09/24/2015 15:16h
ISBN (altènatif notations): 3-639-42571-5, 978-3-639-42571-0
Achiv yo antre:
9783639425710 - Andreas Wotzlaw: Scheduling Unrelated Parallel Machines - Liv

(?):

Scheduling Unrelated Parallel Machines (2012) (?)

Livrezon nan: AlmayLiv AlmanSa se yon paperback livNouvo livréimprimer
ISBN:

9783639425710 (?) ni ni 3639425715

, an Alman, AV Akademikerverlag Jun 2012, Paperback, Nouvo, réimprimer
This item is printed on demand - Print on Demand Titel. Neuware - Revision with unchanged content. 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. 144 pp. Englisch
Plis…
Soti nan 09/24/2015 15:16h
ISBN (altènatif notations): 3-639-42571-5, 978-3-639-42571-0

9783639425710

Jwenn tout liv disponib pou nimewo ISBN ou 9783639425710 konpare pwi vit ak fasil epi pase lòd imedyatman.

Disponib liv vyann kri, itilize liv ak dezyèm men liv ki Tit "Scheduling Unrelated Parallel Machines: Algorithms, Complexity, and Performance" soti Wotzlaw, Andreas konplètman make.

ulli oder uli schreibweise www.tessaundhardin.de