Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5777518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online scheduling on unbounded parallel-batch machines to minimize the makespan |
scientific article; zbMATH DE number 5777518 |
Statements
Online scheduling on unbounded parallel-batch machines to minimize the makespan (English)
0 references
1 September 2010
0 references
algorithms
0 references
online scheduling
0 references
parallel-batch machines
0 references
makespan
0 references
competitive ratio
0 references
0 references
0.9249803423881532
0 references
0.9203937649726868
0 references
0.918708324432373
0 references
0.9093652367591858
0 references
