Sciweavers

EOR
2002
79views more  EOR 2002»
13 years 10 months ago
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 sche...
Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyo...