Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179)
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: Fast heuristics for minimizing the makespan in non-permutation flow shops |
scientific article; zbMATH DE number 6938904
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast heuristics for minimizing the makespan in non-permutation flow shops |
scientific article; zbMATH DE number 6938904 |
Statements
Fast heuristics for minimizing the makespan in non-permutation flow shops (English)
0 references
18 September 2018
0 references
scheduling
0 references
metaheuristics
0 references
flow shop
0 references
non-permutation schedules
0 references
makespan
0 references
iterated greedy algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
