A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines (Q2931730)
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: A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines |
scientific article; zbMATH DE number 6374347
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines |
scientific article; zbMATH DE number 6374347 |
Statements
A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES (English)
0 references
26 November 2014
0 references
scheduling
0 references
online algorithm
0 references
parallel batch
0 references
maximum flow-time
0 references
competitive ratio
0 references
0.9328567385673524
0 references
0.912990927696228
0 references
0.8954223990440369
0 references
0.8857289552688599
0 references
