On the approximability of average completion time scheduling under precedence constraints. (Q1408829)
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: On the approximability of average completion time scheduling under precedence constraints. |
scientific article; zbMATH DE number 1985928
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the approximability of average completion time scheduling under precedence constraints. |
scientific article; zbMATH DE number 1985928 |
Statements
On the approximability of average completion time scheduling under precedence constraints. (English)
0 references
25 September 2003
0 references
Scheduling
0 references
Precedence constraints
0 references
Interval order
0 references
Bipartite order
0 references
Approximation algorithms
0 references
Approximability threshold
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
