Minimizing completion time variance with compressible processing times (Q1781972)
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 2174793
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing completion time variance with compressible processing times |
scientific article; zbMATH DE number 2174793 |
Statements
Minimizing completion time variance with compressible processing times (English)
0 references
9 June 2005
0 references
Completion time variance
0 references
Compressible processing times
0 references
Scheduling
0 references
0 references
0.8438765406608582
0 references
0.8429573178291321
0 references
0.8429573178291321
0 references
0.8341031074523926
0 references
