Two-machine open shop problem with agreement graph

DOI10.1016/j.tcs.2019.09.005zbMath1435.90073MaRDI QIDQ2333794

Farouk Yalaoui, Mourad Boudhar, Nour El Houda Tellache

Publication date: 13 November 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.09.005

zbMATH Keywords

complexity; scheduling; makespan; open shop; agreement graphs

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90B35: Deterministic scheduling theory in operations research

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