| 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: | Cheng T.C.E., Cai X. |
| Keywords: | networks: scheduling |
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.