A unified approach to approximating resource allocation and scheduling.

A unified approach to approximating resource allocation and scheduling.

We present a general framework for solving resource allocation and scheduling problems. Given a resource of fixed size, we present algorithms that approximate the maximum throughput or the minimum loss by a constant factor. Our approximation factors apply to many problems, among which are: (i) real-...

Täydet tiedot

Bibliografiset tiedot
Julkaisussa:Journal of the ACM 48, 5 (2001).
Päätekijä: Bar-Noy, Amotz
Aineistotyyppi: Artikkeli
Kieli:English
Aiheet:
Theory of computation.
Analysis of algorithms and problem complexity.
Nonnumerical algorithms and problems.
Computations on discrete structures.
Sequencing and scheduling.
Algorithms.
Performance.