Tree precedence in scheduling: The strong-weak distinction

DOI10.1016/S0020-0190(99)00103-9zbMath0994.90067MaRDI QIDQ1606979

Joseph Y.-T. Leung, Moshe Dror, Wiesław X. Kubiak

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

`Strong'-`weak' precedence in scheduling: extensions to series-parallel orders