Fast fully polynomial approximation schemes for minimizing completion time variance

Fast fully polynomial approximation schemes for minimizing completion time variance

0.00 Avg rating0 Votes
Article ID: iaor20023212
Country: Netherlands
Volume: 137
Issue: 2
Start Page Number: 303
End Page Number: 309
Publication Date: Mar 2002
Journal: European Journal of Operational Research
Authors: , ,
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.

Reviews

Required fields are marked *. Your email address will not be published.