Computational complexity of some scheduling problems with multiprocessor tasks
From MaRDI portal
Publication:1019301
DOI10.1016/j.disopt.2005.08.001zbMath1166.90344MaRDI QIDQ1019301
Oguz, Ceyda, Yakov Zinder, Van Ha Do
Publication date: 2 June 2009
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2005.08.001
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research