A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Q1885958): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:07, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion |
scientific article |
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
