Completion time variance minimization on a single machine is difficult

Completion time variance minimization on a single machine is difficult

0.00 Avg rating0 Votes
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:
Keywords: computational analysis
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. This paper proves that the CTV problem is NP-hard.

Reviews

Required fields are marked *. Your email address will not be published.