On complexity of optimal recombination for flowshop scheduling problems (Q3186862)

From MaRDI portal
Revision as of 21:11, 1 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers