The \(m\)-machine flowshop problem with unit-time operations and intree precedence constraints

DOI10.1016/J.ORL.2004.08.001zbMath1140.90387OpenAlexW1988784053MaRDI QIDQ1779705

Ilya Chernykh, Oded Berman, Igor Averbakh

Publication date: 1 June 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.08.001

zbMATH Keywords

SchedulingFlowshopPolynomial algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
• Complexity results for single-machine problems with positive finish-start time-lags

This page was built for publication: The \(m\)-machine flowshop problem with unit-time operations and intree precedence constraints