Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992)

From MaRDI portal
Revision as of 06:45, 14 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6305869
Language Label Description Also known as
English
Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
scientific article; zbMATH DE number 6305869

    Statements

    Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 June 2014
    0 references
    0 references
    flow-shop problem
    0 references
    scheduling
    0 references
    iterated local search
    0 references
    parallelizable algorithms
    0 references
    biased randomized heuristics
    0 references
    metaheuristics
    0 references
    parameters setting
    0 references