A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223)
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: A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion |
scientific article; zbMATH DE number 6650749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion |
scientific article; zbMATH DE number 6650749 |
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
0.8919354
0 references
0.8894148
0 references
0.8867553
0 references
0.88170767
0 references
0.86783576
0 references
0.8650834
0 references
