Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621)
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: Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan |
scientific article; zbMATH DE number 6544309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan |
scientific article; zbMATH DE number 6544309 |
Statements
Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (English)
0 references
23 February 2016
0 references
two-agent scheduling
0 references
parallel machines
0 references
makespan
0 references
approximation algorithm
0 references
0 references
0 references
0.9171165227890016
0 references
0.8871852159500122
0 references
0.8811444640159607
0 references
0.8669840097427368
0 references
