\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171)
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: \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling |
scientific article; zbMATH DE number 912517
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling |
scientific article; zbMATH DE number 912517 |
Statements
\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (English)
0 references
1 August 1996
0 references
multiprocessor scheduling
0 references
partial orders
0 references
precedence constrained \(K\)-processor scheduling
0 references
parameterized complexity
0 references
0 references
0 references
