New lower and upper bounds for on-line scheduling (Q1892104)

From MaRDI portal
Revision as of 23:17, 28 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
New lower and upper bounds for on-line scheduling
scientific article

    Statements

    New lower and upper bounds for on-line scheduling (English)
    0 references
    0 references
    0 references
    0 references
    6 July 1995
    0 references
    0 references
    worst-case analysis
    0 references
    on-line scheduling a set of independent jobs
    0 references
    parallel and identical machines
    0 references