Algorithms with limited number of preemptions for scheduling on parallel machines (Q2897985)
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 6057325
| 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 6057325 |
Statements
Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines (English)
0 references
16 July 2012
0 references
\(i\)-preemptive scheduling
0 references
approximation algorithm
0 references
worst case ratio
0 references
makespan
0 references
0.9971329569816588
0 references
0.8969709277153015
0 references
0.8957366943359375
0 references
0.8498063683509827
0 references
0.845486581325531
0 references
