Hybrid tabu search algorithms for permutation flow shops to minimize total flowtime (Q3641997)
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: Hybrid tabu search algorithms for permutation flow shops to minimize total flowtime |
scientific article; zbMATH DE number 5631261
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybrid tabu search algorithms for permutation flow shops to minimize total flowtime |
scientific article; zbMATH DE number 5631261 |
Statements
11 November 2009
0 references
permutation flow shops
0 references
heuristic algorithm
0 references
tabu search
0 references
total flowtime
0 references
0.8547257781028748
0 references
0.842340350151062
0 references
0.8414627313613892
0 references
0.8396079540252686
0 references
0.8392254114151001
0 references
