A matheuristic approach for the two-machine total completion time flow shop problem (Q744632)
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: A matheuristic approach for the two-machine total completion time flow shop problem |
scientific article; zbMATH DE number 6347865
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A matheuristic approach for the two-machine total completion time flow shop problem |
scientific article; zbMATH DE number 6347865 |
Statements
A matheuristic approach for the two-machine total completion time flow shop problem (English)
0 references
26 September 2014
0 references
matheuristic
0 references
integer programming formulation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.846280038356781
0 references
0.8090489506721497
0 references
0.8046585321426392
0 references
0.7940441966056824
0 references
