Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164)
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: Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time |
scientific article; zbMATH DE number 6150461
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time |
scientific article; zbMATH DE number 6150461 |
Statements
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (English)
0 references
4 April 2013
0 references
online algorithms
0 references
scheduling
0 references
parallel-batch machines
0 references
maximum flow-time
0 references
competitive ratio
0 references
0 references
0 references
