On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311)

From MaRDI portal
Revision as of 01:37, 3 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
On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
scientific article

    Statements

    On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (English)
    0 references
    0 references
    0 references
    21 July 2010
    0 references
    0 references
    scheduling
    0 references
    combinatorial optimization
    0 references
    time-indexing
    0 references
    0 references
    0 references