Chains and trees: `Strong' -- `weak' order in job scheduling

DOI10.1023/A:1006014810928zbMath0909.90176MaRDI QIDQ1267547

Moshe Dror

Publication date: 13 October 1998

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

NP-hardnesspolynomial time solvabilitystrong-weak precedence distinction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

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

This page was built for publication: Chains and trees: `Strong' -- `weak' order in job scheduling