A note on unbounded parallel-batch scheduling (Q495685)
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 6482182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on unbounded parallel-batch scheduling |
scientific article; zbMATH DE number 6482182 |
Statements
A note on unbounded parallel-batch scheduling (English)
0 references
15 September 2015
0 references
analysis of algorithm
0 references
parallel-batch scheduling
0 references
maximum cost
0 references
strongly polynomial time
0 references
Pareto optimization
0 references
0 references
0.8983255624771118
0 references
0.8714889287948608
0 references
0.8647772073745728
0 references
0.8501418828964233
0 references
0.8484068512916565
0 references
