On the hardness of the classical job shop problem

DOI10.1023/A:1018990932547zbMath0958.90034OpenAlexW12667919MaRDI QIDQ1960323

Thomas Tautenhahn, Martin Harborth, Per Willenius, Heidemarie Bräsel

Publication date: 11 January 2000

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018990932547

zbMATH Keywords

enumerationopen shopjob shopirreducible sequences

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

Four decades of research on the open-shop scheduling problem to minimize the makespan

This page was built for publication: On the hardness of the classical job shop problem