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]

@article{WanY13,
  title = {Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard},
  author = {Long Wan and Jinjiang Yuan},
  year = {2013},
  doi = {10.1016/j.orl.2013.04.007},
  url = {http://dx.doi.org/10.1016/j.orl.2013.04.007},
  researchr = {https://researchr.org/publication/WanY13},
  cites = {0},
  citedby = {0},
  journal = {Oper. Res. Lett.},
  volume = {41},
  number = {4},
  pages = {363-365},
}