A comparison of local search methods for flow shop scheduling (Q1919857)
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 comparison of local search methods for flow shop scheduling |
scientific article; zbMATH DE number 910217
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comparison of local search methods for flow shop scheduling |
scientific article; zbMATH DE number 910217 |
Statements
A comparison of local search methods for flow shop scheduling (English)
0 references
28 July 1996
0 references
threshold accepting
0 references
local search
0 references
approximate solutions
0 references
neighbourhood search
0 references
genetic algorithms
0 references
simulated annealing
0 references
tabu search
0 references
hybrid method
0 references
permutation flow shop
0 references
total weighted completion time
0 references
0 references
0 references
0 references
0.9443488
0 references
0 references
0 references
0.9129477
0 references
0.91244054
0 references
0.90534973
0 references
0.90422976
0 references
