Completion time variance minimization on a single machine is difficult (Q1317023)
From MaRDI portal
!
WARNING
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 527410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completion time variance minimization on a single machine is difficult |
scientific article; zbMATH DE number 527410 |
Statements
Completion time variance minimization on a single machine is difficult (English)
0 references
17 April 1994
0 references
NP-completeness
0 references
completion time variance minimization
0 references
single machine
0 references
0 references
0.8518999218940735
0 references
0.8518999218940735
0 references
0.8213114142417908
0 references
0.8185886740684509
0 references
0.8185886740684509
0 references
