Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines (Q1889769)
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 algorithms for semi-online preemptive scheduling problems on two uniform machines |
scientific article; zbMATH DE number 2121538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines |
scientific article; zbMATH DE number 2121538 |
Statements
Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines (English)
0 references
9 December 2004
0 references
0.9447003602981568
0 references
0.9142292141914368
0 references
0.9140198826789856
0 references
0.9081562161445618
0 references
0.9077327251434326
0 references
