Useful structures and how to find them : hardness and approximation results for various variants of the parallel task scheduling problem
M.Sc. Malin Rau
Alternative title: | Nützliche Strukturen und wie sie zu finden sind |
---|---|
Year of publication: |
2019
|
Authors: | Rau, Malin |
Other Persons: | Jansen, Klaus (degree supervisor) ; Megow, Nicole (degree supervisor) ; Mounié, Grégory (degree supervisor) |
Institutions: | Christian-Albrechts-Universität zu Kiel (degree granting) |
Publisher: |
2019: Kiel : Universitätsbibliothek Kiel |
Subject: | Strip Packing | Parallel Task Scheduling | Cluster Scheduling | Pseudo-Polynomial | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm |
Saved in:
freely available
Extent: | 1 Online-Ressource (xiii, 327 Seiten) Illustrationen |
---|---|
Type of publication: | Book / Working Paper |
Type of publication (narrower categories): | Hochschulschrift ; Graue Literatur ; Non-commercial literature |
Language: | English |
Thesis: | Dissertation, Christian-Albrechts-Universität zu Kiel, 2019 |
Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012178098
Saved in favorites
Similar items by subject
-
A tight analysis of Brown-Baker-Katseff sequences for online strip packing
Kern, Walter, (2013)
-
A new lower bound for online strip packing
Yu, Guosong, (2016)
-
An adaptive selection approach for the 2D rectangle packing area minimization problem
Wei, Lijun, (2018)
- More ...
Similar items by person