Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel (Q5438523)
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: Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel |
scientific article; zbMATH DE number 5229685
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel |
scientific article; zbMATH DE number 5229685 |
Statements
Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel (English)
0 references
23 January 2008
0 references
order scheduling
0 references
NP-hard
0 references
approximation algorithms
0 references
0.9397612
0 references
0.92451096
0 references
0 references
0.9231316
0 references
0.9223393
0 references
0.9210876
0 references
0.9188876
0 references
0.9130326
0 references
