Fast fully polynomial approximation schemes for minimizing completion time variance
We present fully polynomial approximation schemes (FPASs) for the problem of minimizing completion time variance (CTV) of a set of n jobs on a single machine. The fastest of these schemes runs in time O(n2/?) and thus improves on all fully polynomial approximation schemes presented in the literature.
fully polynomial approximation scheme completion time variance scheduling