The time dependent machine makespan problem is strongly NP-complete

T. C. Edwin Cheng, Qing Ding. The time dependent machine makespan problem is strongly NP-complete. Computers & OR, 26(8):749-754, 1999. [doi]

Abstract

Abstract is missing.