A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2019.104767 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2967278017 / rank | |||
Normal rank | |||
Revision as of 22:29, 19 March 2024
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
