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 this page instead for the normal view: Fast fully polynomial approximation schemes for minimizing completion time variance |
scientific article; zbMATH DE number 1756494
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
