A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724)

From MaRDI portal
Revision as of 23:35, 26 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127366159, #quickstatements; #temporary_batch_1721950759712)
scientific article
Language Label Description Also known as
English
A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
scientific article

    Statements

    A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (English)
    0 references
    0 references
    18 October 2019
    0 references
    scheduling
    0 references
    flowshop
    0 references
    heuristics
    0 references
    flow shop
    0 references
    tie-breaking
    0 references
    NEH
    0 references
    iterated greedy
    0 references

    Identifiers