Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463)
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 6653503
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime |
scientific article; zbMATH DE number 6653503 |
Statements
Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (English)
0 references
16 November 2016
0 references
parallel identical machines
0 references
makespan
0 references
total completion time
0 references
approximation algorithms for scheduling
0 references
0 references
0.8770594000816345
0 references
0.8186039328575134
0 references
0.814476728439331
0 references
0.8098967671394348
0 references
