Algorithms better than LPT for semi-online scheduling with decreasing processing times (Q1758275)
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 6103788
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms better than LPT for semi-online scheduling with decreasing processing times |
scientific article; zbMATH DE number 6103788 |
Statements
Algorithms better than LPT for semi-online scheduling with decreasing processing times (English)
0 references
8 November 2012
0 references
online algorithms
0 references
semi-online algorithms
0 references
competitive ratio
0 references
multiprocessor scheduling
0 references
0.8615402579307556
0 references
0.8482273817062378
0 references
0.8314046263694763
0 references
0.8307620882987976
0 references
