The Machine Duplication Problem in a Job Shop with Two Jobs
From MaRDI portal
Publication:5689969
DOI10.1111/j.1475-3995.1995.tb00004.xzbMath0868.90061MaRDI QIDQ5689969
Alessandro Agnetis, Gianpaolo Oriolo
Publication date: 15 January 1997
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.1995.tb00004.x
job shop scheduling; NP-completeness; heuristic; polynomial time; flexible manufacturing cells; complexity of the machine duplication problem
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
90C39: Dynamic programming
Related Items
Cites Work