Chains and trees: `Strong' -- `weak' order in job scheduling (Q1267547)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Chains and trees: `Strong' -- `weak' order in job scheduling |
scientific article; zbMATH DE number 1210053
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chains and trees: `Strong' -- `weak' order in job scheduling |
scientific article; zbMATH DE number 1210053 |
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
0.89062995
0 references
0 references
0.8488914
0 references
0.8427993
0 references
0.8272517
0 references
0.8272516
0 references
0 references
