New lower and upper bounds for on-line scheduling (Q1892104): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 13:15, 1 February 2024

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