A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time (Q1414243): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1434070 |
||
| Property / author | |||
| Property / author: Nicolai Pisaruk / rank | |||
Revision as of 23:13, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time |
scientific article |
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
