A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- Location
-
München, Bibliothek der Technischen Universität -- 0102/DAT 001z 2001 A 999-3580#S.828-839
- Extent
-
1 Online-Ressource (S. [828] - 839)
- Language
-
Englisch
- Notes
-
In: Automata, languages and programming. - Berlin [u.a.] : Springer, 2005
- Event
-
Veröffentlichung
- (where)
-
Berlin [u.a.]
- (who)
-
Springer
- (when)
-
2005
- Creator
- URN
-
urn:nbn:de:bvb:12-bsb00057413-6
- Last update
-
16.04.2025, 8:47 AM CEST
Data provider
This object is provided by:
Bayerische Staatsbibliothek. If you have any questions about the object, please contact the data provider.
Bayerische Staatsbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Gairing, Martin
- Monien, Burkhard
- Woclaw, Andreas
- Springer
Time of origin
- 2005
Other Objects (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
A PTAS for Scheduling Unrelated Machines of Few Different Types
New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines
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
A PTAS for Scheduling Unrelated Machines of Few Different Types
New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines
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
A PTAS for Scheduling Unrelated Machines of Few Different Types
New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines
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