Name
Title | ||
|---|---|---|
A half-product based approximation scheme for agreeably weighted completion time variance |
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.ejor.2003.10.045 | European Journal of Operational Research |
Keywords | Field | DocType |
Scheduling,Fully polynomial time approximation scheme,Weighted completion time variance,Agreeable weights,Half-products | Mathematical optimization,Scheduling (computing),Algorithm,Time variance,Time complexity,Mathematics,Polynomial-time approximation scheme | Journal |
Volume | Issue | ISSN |
162 | 1 | 0377-2217 |
Citations | PageRank | References |
7 | 0.50 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jinliang Cheng | 1 | 26 | 1.73 |
| Wieslaw Kubiak | 2 | 540 | 62.61 |