Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits (Q6547130)
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 7856502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits |
scientific article; zbMATH DE number 7856502 |
Statements
Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits (English)
0 references
30 May 2024
0 references
bicriteria scheduling
0 references
flowshop
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.8771323561668396
0 references
0.8553665280342102
0 references
0.8427472710609436
0 references
0.8373405933380127
0 references
0.8324385285377502
0 references
