``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation

DOI10.1016/j.ejor.2010.05.034zbMath1205.68174MaRDI QIDQ992654

J. Martínez

Publication date: 9 September 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.05.034

zbMATH Keywords

scheduling; complexity theory; FPTAS; subset product; systems reliability

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)