Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624)
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: Solving the continuous flow-shop scheduling problem by metaheuristics. |
scientific article; zbMATH DE number 1992893
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the continuous flow-shop scheduling problem by metaheuristics. |
scientific article; zbMATH DE number 1992893 |
Statements
Solving the continuous flow-shop scheduling problem by metaheuristics. (English)
0 references
14 October 2003
0 references
Metaheuristics
0 references
Heuristics
0 references
Tabu search
0 references
Simulated annealing
0 references
Continuous flow-shop scheduling
0 references
Time-dependent traveling salesman problem
0 references
0 references
0 references
0 references
0 references
0 references
