A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (Q657251): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:52, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan |
scientific article |
Statements
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (English)
0 references
16 January 2012
0 references
parallel-batch scheduling
0 references
online algorithm
0 references
restart
0 references
competitive ratio
0 references
