Approximation algorithms for scheduling unrelated parallel machines (Q751989)
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 4179126
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for scheduling unrelated parallel machines |
scientific article; zbMATH DE number 4179126 |
Statements
Approximation algorithms for scheduling unrelated parallel machines (English)
0 references
1990
0 references
worst case analysis
0 references
parallel machines
0 references
independent jobs
0 references
makespan
0 references
polynomial algorithm
0 references
polynomial approximation scheme
0 references
relaxations
0 references
0 references
0 references
0.9184253811836244
0 references
0.9129811525344848
0 references
0.9036908149719238
0 references
0.8981266617774963
0 references
0.888771653175354
0 references
