Algorithms with limited number of preemptions for scheduling on parallel machines (Q2015808)
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: Algorithms with limited number of preemptions for scheduling on parallel machines |
scientific article; zbMATH DE number 6307085
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms with limited number of preemptions for scheduling on parallel machines |
scientific article; zbMATH DE number 6307085 |
Statements
Algorithms with limited number of preemptions for scheduling on parallel machines (English)
0 references
24 June 2014
0 references
\(i\)-preemptive scheduling
0 references
approximation algorithm
0 references
worst case ratio
0 references
makespan
0 references
0.9971329569816588
0 references
0.8979726433753967
0 references
0.8925859928131104
0 references
0.851469099521637
0 references
0.8460220098495483
0 references
