On the approximability of average completion time scheduling under precedence constraints. (Q1408829): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:34, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the approximability of average completion time scheduling under precedence constraints. |
scientific article |
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
