Parallel machine covering with limited number of preemptions (Q462268)
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: Parallel machine covering with limited number of preemptions |
scientific article; zbMATH DE number 6365071
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel machine covering with limited number of preemptions |
scientific article; zbMATH DE number 6365071 |
Statements
Parallel machine covering with limited number of preemptions (English)
0 references
3 November 2014
0 references
preemptive scheduling
0 references
machine covering
0 references
approximation algorithm
0 references
worst case ratio
0 references
0 references
0 references
0.95688677
0 references
0 references
0.9002649
0 references
0.8944471
0 references
0.8880494
0 references
0.88034856
0 references
0.8684675
0 references
0 references
