A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems (Q1768611)

From MaRDI portal
Revision as of 08:21, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
scientific article

    Statements

    A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    15 March 2005
    0 references
    production/scheduling
    0 references
    approximations/heuristic: multi-exchange neighborhood
    0 references
    networks/graphs
    0 references
    flow algorithms: disjoint cycle computation
    0 references

    Identifiers