Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme.

Klaus Jansen Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme. 59-81 2004 39 Algorithmica 1 http://dx.doi.org/10.1007/s00453-003-1078-6 db/journals/algorithmica/algorithmica39.html#Jansen04