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-...

Szczegółowa specyfikacja

Opis bibliograficzny

Wydane w:	Journal of the ACM 48, 5 (2001).
1. autor:	Bar-Noy, Amotz
Format:	Artykuł
Język:	English
Hasła przedmiotowe:	Theory of computation. Analysis of algorithms and problem complexity. Nonnumerical algorithms and problems. Computations on discrete structures. Sequencing and scheduling. Algorithms. Performance.