A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times

Radoslaw Rudek. A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times. Optimization Letters, 7(3):613-616, 2013. [doi]

@article{Rudek13-0,
  title = {A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times},
  author = {Radoslaw Rudek},
  year = {2013},
  doi = {10.1007/s11590-012-0445-0},
  url = {http://dx.doi.org/10.1007/s11590-012-0445-0},
  researchr = {https://researchr.org/publication/Rudek13-0},
  cites = {0},
  citedby = {0},
  journal = {Optimization Letters},
  volume = {7},
  number = {3},
  pages = {613-616},
}