T. C. Edwin Cheng, Qing Ding. The time dependent machine makespan problem is strongly NP-complete. Computers & OR, 26(8):749-754, 1999. [doi]
@article{ChengD99,
title = {The time dependent machine makespan problem is strongly NP-complete},
author = {T. C. Edwin Cheng and Qing Ding},
year = {1999},
doi = {10.1016/S0305-0548(98)00093-8},
url = {http://dx.doi.org/10.1016/S0305-0548(98)00093-8},
tags = {completeness, C++},
researchr = {https://researchr.org/publication/ChengD99},
cites = {0},
citedby = {0},
journal = {Computers & OR},
volume = {26},
number = {8},
pages = {749-754},
}