A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2019.104767 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127366159 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2019.104767 / rank | |||
Normal rank | |||
Latest revision as of 01:06, 18 December 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
0 references
0 references
0 references
0 references
