Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem (Q2341222)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem |
scientific article |
Statements
Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem (English)
0 references
23 April 2015
0 references
flexible flowshop
0 references
group scheduling
0 references
sequence-dependent setup time
0 references
branch and price algorithm
0 references
lower bound
0 references
memetic algorithm
0 references
0 references
0 references
