Branch and bound crossed with GA to solve hybrid flowshops (Q1296101)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch and bound crossed with GA to solve hybrid flowshops |
scientific article |
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
