Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905)
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: Optimal semi-online preemptive algorithms for machine covering on two uniform machines |
scientific article; zbMATH DE number 2184102
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal semi-online preemptive algorithms for machine covering on two uniform machines |
scientific article; zbMATH DE number 2184102 |
Statements
Optimal semi-online preemptive algorithms for machine covering on two uniform machines (English)
0 references
30 June 2005
0 references
Online algorithm
0 references
Preemptive scheduling
0 references
Machine covering
0 references
Competitive ratio
0 references
0.9007885456085204
0 references
0.8972358703613281
0 references
0.8968854546546936
0 references
0.8949589133262634
0 references
0.8900614380836487
0 references
