Unrelated parallel machine scheduling using local search (Q1341398)

From MaRDI portal
Revision as of 01:58, 19 July 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
Unrelated parallel machine scheduling using local search
scientific article

    Statements

    Unrelated parallel machine scheduling using local search (English)
    0 references
    0 references
    0 references
    0 references
    11 January 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    local search
    0 references
    simulated annealing
    0 references
    taboo search
    0 references
    approximate solutions
    0 references
    genetic algorithms
    0 references
    unrelated parallel machines
    0 references
    maximum completion time
    0 references
    hybrid method
    0 references