EOR
2002
13 years 5 months ago
2002
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 sche...