- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1436-4646
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Approximability of average completion time scheduling on unrelated machines ; day:21 ; month:4 ; year:2016 ; pages:1-24
Mathematical programming ; (21.4.2016), 1-24
- Urheber
-
Sitters, René
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10107-016-1004-8
- URN
-
urn:nbn:de:1111-2016042211546
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:52 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Sitters, René
- SpringerLink (Online service)
Ä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.
On the Configuration-LP for Scheduling on Unrelated Machines
On-line scheduling to minimize average completion time revisited
A faster combinatorial approximation algorithm for scheduling unrelated parallel 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
Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms
Improved average estimation in seemingly unrelated regressions
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.
On the Configuration-LP for Scheduling on Unrelated Machines
On-line scheduling to minimize average completion time revisited
A faster combinatorial approximation algorithm for scheduling unrelated parallel 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
Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms
Improved average estimation in seemingly unrelated regressions
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.
On the Configuration-LP for Scheduling on Unrelated Machines
On-line scheduling to minimize average completion time revisited
A faster combinatorial approximation algorithm for scheduling unrelated parallel 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
Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms