A better lower bound for on-line scheduling (Q1327292)

From MaRDI portal
Revision as of 21:53, 18 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
A better lower bound for on-line scheduling
scientific article

    Statements

    A better lower bound for on-line scheduling (English)
    0 references
    0 references
    0 references
    0 references
    15 June 1994
    0 references
    0 references
    \(m\)-machine scheduling problem
    0 references