A better lower bound for on-line scheduling (Q1327292): 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:35, 31 January 2024

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