A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (Q657251)
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 online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan |
scientific article; zbMATH DE number 5997876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan |
scientific article; zbMATH DE number 5997876 |
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
0 references
0 references
0.9385709762573242
0 references
0.9226330518722534
0 references
0.8991079926490784
0 references
0.8945159912109375
0 references
0.8944341540336609
0 references
