A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model (Q2079980)
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: A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model |
scientific article; zbMATH DE number 7597665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model |
scientific article; zbMATH DE number 7597665 |
Statements
A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model (English)
0 references
7 October 2022
0 references
competitive analysis
0 references
identical machines
0 references
multi list
0 references
makespan
0 references
online scheduling
0 references
parallel submissions
0 references
0 references
0.86643255
0 references
0.85150063
0 references
0.8493668
0 references
0.8466902
0 references
0.84456754
0 references
0.8414837
0 references
0.8389522
0 references
0.83889055
0 references
0.8333851
0 references
