Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029)
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 7619272
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time |
scientific article; zbMATH DE number 7619272 |
Statements
Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (English)
0 references
17 November 2022
0 references
scheduling
0 references
makespan
0 references
total completion time
0 references
approximation algorithm
0 references
inapproximability
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8771323561668396
0 references
0.8450747728347778
0 references
0.8395577669143677
0 references
0.8318715691566467
0 references
