Semi-online scheduling on two identical processors with two types of partial information (Q3373621)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5012437
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semi-online scheduling on two identical processors with two types of partial information |
scientific article; zbMATH DE number 5012437 |
Statements
13 March 2006
0 references
multiprocessor scheduling
0 references
approximation algorithm
0 references
0.8944649696350098
0 references
0.8941828608512878
0 references
0.8923858404159546
0 references
0.8892743587493896
0 references
