Improved bounds for online scheduling with eligibility constraints (Q719259)
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 5955881
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved bounds for online scheduling with eligibility constraints |
scientific article; zbMATH DE number 5955881 |
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
0 references
0 references
0 references
0 references
0.8766630291938782
0 references
0.8756515979766846
0 references
0.8632418513298035
0 references
0.8545219302177429
0 references
0.8545214533805847
0 references
