| PDF (143kB) |
- URN to cite this document:
- urn:nbn:de:bvb:355-epub-212926
- DOI to cite this document:
- 10.5283/epub.21292
Abstract
In double-sided markets for computing resources an optimal allocation schedule among job offers and requests subject to relevant capacity constraints can be determined. With increasing storage demands and emerging storage services the question how to schedule storage jobs becomes more and more interesting. Since such scheduling problems are often in the class NP-complete an exact computation is ...

Owner only: item control page