A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- Standort
-
München, Bibliothek der Technischen Universität -- 0102/DAT 001z 2001 A 999-3580#S.828-839
- Umfang
-
1 Online-Ressource (S. [828] - 839)
- Sprache
-
Englisch
- Anmerkungen
-
In: Automata, languages and programming. - Berlin [u.a.] : Springer, 2005
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin [u.a.]
- (wer)
-
Springer
- (wann)
-
2005
- Urheber
- URN
-
urn:nbn:de:bvb:12-bsb00057413-6
- Letzte Aktualisierung
-
16.04.2025, 08:47 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Bayerische Staatsbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Bayerische Staatsbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Gairing, Martin
- Monien, Burkhard
- Woclaw, Andreas
- Springer
Entstanden
- 2005
Ähnliche Objekte (12)
Scheduling unrelated machines by randomized rounding
Scheduling unrelated parallel machines : algorithms, complexity, and performance
Scheduling unrelated parallel machines : algorithms, complexity, and performance
Scheduling unrelated parallel machines: linear programming strikes back.
Approximability of average completion time scheduling on unrelated machines
On the Configuration-LP for Scheduling on Unrelated Machines
New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines
A PTAS for Scheduling Unrelated Machines of Few Different Types
Integrated maintenance and production scheduling for unrelated parallel machines with setup times
Unrelated Machine Scheduling in Different Information Models
Combinatorial optimization applied to VLBI scheduling
Exact and metaheuristic approaches for unrelated parallel machine scheduling
Scheduling unrelated machines by randomized rounding
Scheduling unrelated parallel machines : algorithms, complexity, and performance
Scheduling unrelated parallel machines : algorithms, complexity, and performance
Scheduling unrelated parallel machines: linear programming strikes back.
Approximability of average completion time scheduling on unrelated machines
On the Configuration-LP for Scheduling on Unrelated Machines
New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines
A PTAS for Scheduling Unrelated Machines of Few Different Types
Integrated maintenance and production scheduling for unrelated parallel machines with setup times
Unrelated Machine Scheduling in Different Information Models
Combinatorial optimization applied to VLBI scheduling
Exact and metaheuristic approaches for unrelated parallel machine scheduling
Scheduling unrelated machines by randomized rounding
Scheduling unrelated parallel machines : algorithms, complexity, and performance
Scheduling unrelated parallel machines : algorithms, complexity, and performance
Scheduling unrelated parallel machines: linear programming strikes back.
Approximability of average completion time scheduling on unrelated machines
On the Configuration-LP for Scheduling on Unrelated Machines
New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines
A PTAS for Scheduling Unrelated Machines of Few Different Types
Integrated maintenance and production scheduling for unrelated parallel machines with setup times
Unrelated Machine Scheduling in Different Information Models
Combinatorial optimization applied to VLBI scheduling