Improved bounds for online scheduling with eligibility constraints (Q719259): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:33, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved bounds for online scheduling with eligibility constraints |
scientific article |
Statements
Improved bounds for online scheduling with eligibility constraints (English)
0 references
10 October 2011
0 references
online scheduling
0 references
parallel machines
0 references
eligibility constraints
0 references
greedy algorithm
0 references
competitive ratio
0 references
