On complexity of optimal recombination for flowshop scheduling problems (Q3186862): Difference between revisions
From MaRDI portal
Latest revision as of 10:07, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On complexity of optimal recombination for flowshop scheduling problems |
scientific article |
Statements
On complexity of optimal recombination for flowshop scheduling problems (English)
0 references
12 August 2016
0 references
flow shop problem
0 references
permutation
0 references
genetic algorithm
0 references
optimal recombination
0 references
0 references
0 references
0 references