Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
From MaRDI portal
Publication:4888150
DOI10.1051/ro/1996300100651zbMath0857.90057OpenAlexW2209665149MaRDI QIDQ4888150
Heidemarie Bräsel, Frank Werner, Dagmar Kluge
Publication date: 24 July 1996
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/105120
polynomial time algorithmworst case complexityunit processing timesminimization of the makespantwo machinesarbitrary precedence constraintsopen shop problemsintree constraints
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items