A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs (Q2637353)
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 6256813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs |
scientific article; zbMATH DE number 6256813 |
Statements
A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs (English)
0 references
11 February 2014
0 references
scheduling
0 references
fully polynomial time approximation
0 references
two-stage flow shop
0 references
makespan
0 references
0 references
0.8450361490249634
0 references
0.8443883061408997
0 references
0.8299663066864014
0 references
0.8258828520774841
0 references
0.8242084383964539
0 references
