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
Changed an Item |
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710434565540 |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 20:44, 14 March 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