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.90021MaRDI 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
scheduling; strong NP-hardness; learning effect; computational analysis; position-dependent processing time
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
Related Items
Cites Work