Best semi-online algorithms for unbounded parallel batch scheduling (Q534351)
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: Best semi-online algorithms for unbounded parallel batch scheduling |
scientific article; zbMATH DE number 5895545
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Best semi-online algorithms for unbounded parallel batch scheduling |
scientific article; zbMATH DE number 5895545 |
Statements
Best semi-online algorithms for unbounded parallel batch scheduling (English)
0 references
17 May 2011
0 references
parallel batch scheduling
0 references
online algorithm
0 references
information in advance
0 references
competitive ratio
0 references
0 references
0 references
0 references
