On the complexity of completion time variance minimization problem

On the complexity of completion time variance minimization problem

0.00 Avg rating0 Votes
Article ID: iaor19941808
Country: Singapore
Volume: 10
Issue: 1
Start Page Number: 109
End Page Number: 120
Publication Date: May 1993
Journal: Asia-Pacific Journal of Operational Research
Authors: ,
Keywords: networks: scheduling
Abstract:

The complexity of the completion time variance problem has been open for a long time. In this paper the authors show that this problem is NP-complete with respect to id-encoding.

Reviews

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