Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage (Q337499)
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: Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage |
scientific article; zbMATH DE number 6650855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage |
scientific article; zbMATH DE number 6650855 |
Statements
Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage (English)
0 references
10 November 2016
0 references
two-stage hybrid flow shop
0 references
computational complexity
0 references
heuristic
0 references
worst case bound on relative error
0 references
0 references
0 references
0.9841290712356568
0 references
0.9443580508232116
0 references
0.8901898860931396
0 references
0.873261034488678
0 references
0.8699164986610413
0 references
