Fast fully polynomial approximation schemes for minimizing completion time variance

Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance 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.

• Type: Journal
• Year: 2002
• Where: EOR
• Authors: Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyov
• Keywords: Completion Time Variance, EOR 2002, Polynomial Approximation Schemes