Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard

Long Wan, Jinjiang Yuan. Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard. Oper. Res. Lett., 41(4):363-365, 2013. [doi]

Abstract

Abstract is missing.