The power of preemption on unrelated machines and applications to scheduling orders (Q5891554)
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: The power of preemption on unrelated machines and applications to scheduling orders |
scientific article; zbMATH DE number 6038637
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The power of preemption on unrelated machines and applications to scheduling orders |
scientific article; zbMATH DE number 6038637 |
Statements
24 May 2012
0 references
machine scheduling
0 references
approximation algorithms
0 references
1.0000001
0 references
0.9019706
0 references
0 references
0 references
0.8949959
0 references
0 references
0.8897735
0 references
The power of preemption on unrelated machines and applications to scheduling orders (English)
0 references
