Approximating the 2-machine flow shop problem with exact delays taking two values (Q2174271)
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 7190923
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the 2-machine flow shop problem with exact delays taking two values |
scientific article; zbMATH DE number 7190923 |
Statements
Approximating the 2-machine flow shop problem with exact delays taking two values (English)
0 references
21 April 2020
0 references
scheduling problem
0 references
flow shop
0 references
exact delays
0 references
approximation algorithm
0 references
inapproximability lower bound
0 references
approximation factor
0 references
0 references
0.8964941501617432
0 references
0.8852664232254028
0 references
0.867843747138977
0 references
0.8487866520881653
0 references
0.8284217119216919
0 references
