A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724)
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 best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective |
scientific article |
Statements
A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (English)
0 references
18 October 2019
0 references
scheduling
0 references
flowshop
0 references
heuristics
0 references
flow shop
0 references
tie-breaking
0 references
NEH
0 references
iterated greedy
0 references
