An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233)
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: An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem |
scientific article; zbMATH DE number 6901381
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem |
scientific article; zbMATH DE number 6901381 |
Statements
An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (English)
0 references
11 July 2018
0 references
combinatorial optimization
0 references
heuristic algorithms
0 references
iterated greedy
0 references
scheduling
0 references
permutation flowshop problem
0 references
makespan
0 references
0 references
0 references
0 references
0 references
0.9427625
0 references
0 references
0.9182118
0 references
0.90876466
0 references
0.9025566
0 references
0.89671725
0 references
0.8845726
0 references
0.8839648
0 references
0.88263273
0 references
