Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179)

From MaRDI portal
Revision as of 00:08, 27 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129506736, #quickstatements; #temporary_batch_1724713111024)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast heuristics for minimizing the makespan in non-permutation flow shops
scientific article

    Statements

    Fast heuristics for minimizing the makespan in non-permutation flow shops (English)
    0 references
    0 references
    0 references
    18 September 2018
    0 references
    scheduling
    0 references
    metaheuristics
    0 references
    flow shop
    0 references
    non-permutation schedules
    0 references
    makespan
    0 references
    iterated greedy algorithm
    0 references
    0 references
    0 references

    Identifiers