| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420287 | Discrete Applied Mathematics | 2006 | 18 Pages |
Abstract
We review approximability and inapproximability results for MIN-SUM scheduling problems and we focus on techniques for designing polynomial time approximation schemes for this class of problems. We present examples which illustrate the efficient use of the ratio partitioning and time partitioning techniques.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
F. Afrati, I. Milis,