Chains and trees: `Strong' -- `weak' order in job scheduling (Q1267547)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chains and trees: `Strong' -- `weak' order in job scheduling |
scientific article |
Statements
Chains and trees: `Strong' -- `weak' order in job scheduling (English)
0 references
13 October 1998
0 references
NP-hardness
0 references
polynomial time solvability
0 references
strong-weak precedence distinction
0 references
