Characterizing sets of jobs that admit optimal greedy-like algorithms (Q964871)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterizing sets of jobs that admit optimal greedy-like algorithms |
scientific article |
Statements
Characterizing sets of jobs that admit optimal greedy-like algorithms (English)
0 references
21 April 2010
0 references
scheduling
0 references
interval scheduling
0 references
priority algorithms
0 references
optimal greedy algorithms
0 references
parallel scheduling
0 references
