On complexity of optimal recombination for flowshop scheduling problems (Q3186862): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:00, 3 February 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
