An FPTAS for the parallel two-stage flowshop problem (Q507441)
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 6680875
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An FPTAS for the parallel two-stage flowshop problem |
scientific article; zbMATH DE number 6680875 |
Statements
An FPTAS for the parallel two-stage flowshop problem (English)
0 references
6 February 2017
0 references
two-stage flowshop scheduling
0 references
multiprocessor scheduling
0 references
makespan
0 references
dynamic programming
0 references
fully polynomial-time approximation scheme
0 references
0 references
0 references
0.9176104664802552
0 references
0.893839955329895
0 references
0.8616722226142883
0 references
0.8616722226142883
0 references
