Title of article
Designing PTASs for MIN-SUM scheduling problems Original Research Article
Author/Authors
F. Afrati، نويسنده , , I. Milis، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
18
From page
622
To page
639
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
Scheduling , MIN-SUM criteria , PTASs , Approximation algorithms
Journal title
Discrete Applied Mathematics
Serial Year
2006
Journal title
Discrete Applied Mathematics
Record number
886225
Link To Document