Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times (Q3087703)
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 5939655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times |
scientific article; zbMATH DE number 5939655 |
Statements
Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times (English)
0 references
16 August 2011
0 references
parallel machine
0 references
scheduling
0 references
review
0 references
total weighted completion time
0 references
relaxation
0 references
algorithm
0 references
0.9383158683776855
0 references
0.8428016901016235
0 references
0.8388214707374573
0 references
0.8349621891975403
0 references
0.8280670642852783
0 references
