A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria (Q954034)

From MaRDI portal
Revision as of 19:57, 28 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
scientific article

    Statements

    A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria (English)
    0 references
    0 references
    0 references
    0 references
    7 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    flexible flow shop
    0 references
    constructive algorithms
    0 references
    simulated annealing
    0 references
    tabu search
    0 references
    genetic algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references