A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Q1885958)
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 very fast tabu search algorithm for the permutation flow shop problem with makespan criterion |
scientific article; zbMATH DE number 2115353
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion |
scientific article; zbMATH DE number 2115353 |
Statements
A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (English)
0 references
12 November 2004
0 references
Flow-shop scheduling
0 references
Makespan
0 references
Heuristics
0 references
Tabu search
0 references
0 references
0 references
