The makespan problem of scheduling multi groups of jobs on multi processors at different speeds (Q2865880)
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: The makespan problem of scheduling multi groups of jobs on multi processors at different speeds |
scientific article; zbMATH DE number 6237557
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The makespan problem of scheduling multi groups of jobs on multi processors at different speeds |
scientific article; zbMATH DE number 6237557 |
Statements
11 December 2013
0 references
heuristic algorithm
0 references
LPT algorithm
0 references
approximate solutions
0 references
optimal solutions
0 references
upper bound
0 references
The makespan problem of scheduling multi groups of jobs on multi processors at different speeds (English)
0 references
0.88148432970047
0 references
0.8660244345664978
0 references
0.8544446229934692
0 references
0.8511283993721008
0 references
