Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:56, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time |
scientific article |
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
