Tree precedence in scheduling: The strong-weak distinction

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

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

Publication date: 25 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00103-9

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

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

This page was built for publication: Tree precedence in scheduling: The strong-weak distinction