A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time (Q340272)
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 multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time |
scientific article; zbMATH DE number 6652540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time |
scientific article; zbMATH DE number 6652540 |
Statements
A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time (English)
0 references
14 November 2016
0 references
scheduling
0 references
metaheuristic
0 references
iterated local search
0 references
permutation flow shop
0 references
total flow time
0 references
0.96070975
0 references
0.9142231
0 references
0.9114528
0 references
0.9029088
0 references
0.89491713
0 references
0.89451236
0 references
0.8899946
0 references
0.8893448
0 references
