An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2016.12.021 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2016.12.021 / rank | |||
Normal rank | |||
Latest revision as of 01:02, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem |
scientific article |
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
