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 this page instead for the normal view: Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times |
scientific article |
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
