Algorithms better than LPT for semi-online scheduling with decreasing processing times (Q1758275): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:01, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms better than LPT for semi-online scheduling with decreasing processing times |
scientific article |
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
