Name
Abstract | ||
|---|---|---|
The complexity of the completion time variance minimization (CTV) problem on a single machine has been open since the paper by Merten and Muller (Management Science 18 (1972)). In this paper we prove that the CTV problem is NP-hard. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1016/0167-6377(93)90019-D | Oper. Res. Lett. |
Keywords | Field | DocType |
variance,scheduling,ctv problem,np-completeness,single machine,management science,completion time variance minimization,np completeness | NP-complete,Mathematical optimization,Combinatorics,Scheduling (computing),Algorithm,Minification,Minimisation (psychology),Time variance,Mathematics | Journal |
Volume | Issue | ISSN |
14 | 1 | Operations Research Letters |
Citations | PageRank | References |
48 | 3.76 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wieslaw Kubiak | 1 | 540 | 62.61 |