Fast fully polynomial approximation schemes for minimizing completion time variance (Q1600838)
From MaRDI portal
!
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 1756494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast fully polynomial approximation schemes for minimizing completion time variance |
scientific article; zbMATH DE number 1756494 |
Statements
Fast fully polynomial approximation schemes for minimizing completion time variance (English)
0 references
16 June 2002
0 references
fully polynomial approximation scheme
0 references
completion time variance
0 references
scheduling
0 references
0.873192310333252
0 references
0.8472336530685425
0 references
0.83586186170578
0 references
0.822235107421875
0 references
0.8181723356246948
0 references
