New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
From MaRDI portal
Publication:1761791
DOI10.1007/s10479-012-1075-8zbMath1251.90113MaRDI QIDQ1761791
Michael Andresen, Tanka Nath Dhamala
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1075-8
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
Related Items
Four decades of research on the open-shop scheduling problem to minimize the makespan, The representation of partially-concurrent open shop problems
Cites Work