Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037)
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 5218962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information |
scientific article; zbMATH DE number 5218962 |
Statements
Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (English)
0 references
10 December 2007
0 references
0 references
0 references
0 references
0.9814777970314026
0 references
0.9543377161026
0 references
0.9535276293754578
0 references
0.8634688258171082
0 references
0.8472162485122681
0 references
