Robust algorithms for total completion time (Q2010916)
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 7138062
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Robust algorithms for total completion time |
scientific article; zbMATH DE number 7138062 |
Statements
Robust algorithms for total completion time (English)
0 references
28 November 2019
0 references
scheduling
0 references
bounded migration factor
0 references
algorithms
0 references
0 references
0.8645359873771667
0 references
0.8602040410041809
0 references
0.8394088745117188
0 references
0.8252288103103638
0 references
0.8179156184196472
0 references
