Name
Abstract | ||
|---|---|---|
We present fully polynomial approximation schemes (FPASs) for the problem of minimizing completion time variance (CTV) 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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0377-2217(01)00211-9 | European Journal of Operational Research |
Keywords | Field | DocType |
Fully polynomial approximation scheme,Completion time variance,Scheduling | Discrete mathematics,Mathematical optimization,Polynomial,Scheduling (computing),Square-free polynomial,Time variance,Mathematics | Journal |
Volume | Issue | ISSN |
137 | 2 | 0377-2217 |
Citations | PageRank | References |
13 | 0.69 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wieslaw Kubiak | 1 | 540 | 62.61 |
| Jinliang Cheng | 2 | 26 | 1.73 |
| Mikhail Y. Kovalyov | 3 | 1602 | 118.18 |