Flow shop scheduling problems under machine-dependent precedence constraints

DOI10.1023/B:JOCO.0000021935.66577.09zbMath1136.90349MaRDI QIDQ1768595

Xianqiang Yang

Publication date: 15 March 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

complexity; polynomial-time algorithm; flow shop; precedence constraints

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research