Computing optimal preemptive schedules for parallel tasks: linear programming approaches
Jansen, Klaus ; Porkolab, Lorant
- Link zu diesem Datensatz
- https://d-nb.info/1187338311
- Titel
- Computing optimal preemptive schedules for parallel tasks: linear programming approaches
- Art des Inhalts
- Teil eines Werks
- Verfassangaben
- by Klaus Jansen, Lorant Porkolab
- Autor(en)
-
- Jansen, Klaus
- Porkolab, Lorant
- Organisation(en)
-
- SpringerLink (Online service)
- Zeitliche Einordnung
- Erscheinungsdatum: 2003
- Umfang/Format
- Online-Ressource
- ISSN
14364646- DOI
- 10.1007/s10107-002-0361-7
- Online
- https://doi.org/10.1007/s10107-002-0361-7
- Sprache
- eng
- Schlagwörter
-
- (lcsh)Computer science--Mathematics.
- (lcsh)Numerical analysis.
- (lcsh)Calculus of variations.
- (lcsh)Combinatorics.
- (lcsh)Physics.
- Calculus of Variations and Optimal Control
- Optimization.
- Mathematics of Computing.
- Numerical Analysis.
- Combinatorics.
- Theoretical, Mathematical and Computational Physics.
- Mathematical Methods in Physics.
- Frühere/spätere Titel
-
- Enthalten in: Mathematical programming
- Enthalten in: Mathematical programming
- Enthalten in: Mathematical programming
- Stand
- 01.06.2021 18:57
- Im Katalog seit
- 07.03.2026