Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation (Q3580981)
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: Multi-processor scheduling to minimize flow time with resource augmentation |
scientific article; zbMATH DE number 5770722
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation |
scientific article; zbMATH DE number 5770722 |
Statements
Multi-processor scheduling to minimize flow time with ε resource augmentation (English)
0 references
15 August 2010
0 references
0.873434841632843
0 references
0.8712186813354492
0 references
0.8646127581596375
0 references
0.8645827174186707
0 references
