Classical and new heuristics for the open-shop problem: A computational evaluation (Q1296088)

From MaRDI portal
Revision as of 21:19, 28 May 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
Classical and new heuristics for the open-shop problem: A computational evaluation
scientific article

    Statements

    Classical and new heuristics for the open-shop problem: A computational evaluation (English)
    0 references
    0 references
    0 references
    13 September 2000
    0 references
    0 references
    local search
    0 references
    minimum makespan schedules
    0 references
    open-shop
    0 references
    heuristics
    0 references
    matchings
    0 references
    bipartite graph
    0 references