Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough (Q3527263)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough |
scientific article |
Statements
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough (English)
0 references
25 September 2008
0 references
online scheduling
0 references
non-clairvoyant algorithm
0 references
batch scheduling
0 references
fairness
0 references
equi-partition
0 references
makespan and overall set completion time minimization
0 references
0.8113241195678711
0 references
0.7956287860870361
0 references
0.7916612029075623
0 references
0.7893775105476379
0 references
