Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9663965 | European Journal of Operational Research | 2005 | 10 Pages |
Abstract
A recent INFORMS Journal on Computing paper presents a fully polynomial time approximation scheme for minimizing the completion time variance with agreeable weights on a single machine. This paper presents a much faster scheme for this problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jinliang Cheng, Wieslaw Kubiak,