Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026)
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: Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion |
scientific article; zbMATH DE number 6901266
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion |
scientific article; zbMATH DE number 6901266 |
Statements
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (English)
0 references
11 July 2018
0 references
meta-heuristics
0 references
blocking flowshop
0 references
iterated greedy algorithm
0 references
variable neighborhood search
0 references
constructive heuristics
0 references
0 references
0 references
0 references
0.93627614
0 references
0.9182118
0 references
0.9149026
0 references
0.91464305
0 references
0.91054356
0 references
0.90851605
0 references
0.89086264
0 references
0 references
