Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture (Q783686)
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 7227689
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture |
scientific article; zbMATH DE number 7227689 |
Statements
Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture (English)
0 references
4 August 2020
0 references
parallel identical machines
0 references
makespan
0 references
total flow time
0 references
approximation algorithms
0 references
multi-processor scheduling
0 references
0.8770594000816345
0 references
0.7869512438774109
0 references
0.7803937792778015
0 references
0.7690156102180481
0 references
0.7656818628311157
0 references
