A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion |
scientific article |
Statements
A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (English)
0 references
10 November 2016
0 references
scheduling
0 references
limited-buffer permutation flow shop
0 references
makespan
0 references
variable neighborhood search
0 references
simulated annealing algorithm
0 references
blocking flow shop
0 references
0 references
0 references
0 references
