A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration (Q5059372)
From MaRDI portal
scientific article; zbMATH DE number 7637148
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration |
scientific article; zbMATH DE number 7637148 |
Statements
A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration (English)
0 references
23 December 2022
0 references
two-stage assembly
0 references
genetic algorithm
0 references
simulated annealing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
