Article ID: | iaor1995118 |
Country: | Netherlands |
Volume: | 14 |
Issue: | 1 |
Start Page Number: | 49 |
End Page Number: | 59 |
Publication Date: | Aug 1993 |
Journal: | Operations Research Letters |
Authors: | Kubiak Wieslaw |
Keywords: | computational analysis |
The complexity of the completion time variance minimization (CTV) problem on a single machine has been open since the paper by Merten and Muller. This paper proves that the CTV problem is NP-hard.