Branch and bound crossed with GA to solve hybrid flowshops (Q1296101)
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: Branch and bound crossed with GA to solve hybrid flowshops |
scientific article; zbMATH DE number 1314781
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch and bound crossed with GA to solve hybrid flowshops |
scientific article; zbMATH DE number 1314781 |
Statements
Branch and bound crossed with GA to solve hybrid flowshops (English)
0 references
10 September 2000
0 references
genetic algorithm
0 references
hybrid flowshop scheduling
0 references
branch-and-bound algorithm
0 references
heuristics
0 references
initial upper bound
0 references
0.9020923
0 references
0.87332535
0 references
0.86807144
0 references
0.8634372
0 references
0.8582694
0 references
0.8550456
0 references
