The minimization scheduling problem of sum of squares of the machine completion times on two identical parallel machines (Q3195877)
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 minimization scheduling problem of sum of squares of the machine completion times on two identical parallel machines |
scientific article; zbMATH DE number 6501382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimization scheduling problem of sum of squares of the machine completion times on two identical parallel machines |
scientific article; zbMATH DE number 6501382 |
Statements
28 October 2015
0 references
off-line scheduling
0 references
worst case ratio
0 references
0.822801411151886
0 references
0.8104398846626282
0 references
0.7916825413703918
0 references
0.7739965319633484
0 references
0.7624170184135437
0 references
