Tight complexity analysis of the relocation problem with arbitrary release dates (Q638514)

From MaRDI portal
Revision as of 11:21, 4 July 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
Tight complexity analysis of the relocation problem with arbitrary release dates
scientific article

    Statements

    Tight complexity analysis of the relocation problem with arbitrary release dates (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    relocation problem
    0 references
    resource constraints
    0 references
    release dates
    0 references
    makespan
    0 references
    NP-hardness
    0 references
    multi-parametric dynamic programming
    0 references
    0 references