A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times
From MaRDI portal
Publication:1941204
DOI10.1007/s11590-012-0445-0zbMath1268.90021OpenAlexW2042016438MaRDI QIDQ1941204
Publication date: 12 March 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0445-0
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Cites Work
This page was built for publication: A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times