A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time (Q1414243)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2006369
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time |
scientific article; zbMATH DE number 2006369 |
Statements
A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time (English)
0 references
20 November 2003
0 references
scheduling
0 references
single machine
0 references
precedence relation
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0.8959727883338928
0 references
0.8959727883338928
0 references
0.8922334909439087
0 references
0.8852713108062744
0 references
