Improved Bounds for the Online Scheduling Problem (Q4706228)

From MaRDI portal
Revision as of 17:01, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1931307
Language Label Description Also known as
English
Improved Bounds for the Online Scheduling Problem
scientific article; zbMATH DE number 1931307

    Statements

    title
    Improved Bounds for the Online Scheduling Problem (English)
    0 references
    author
    John F. Rudin III
    0 references
    R. Chandrasekaran
    0 references
    publication date
    19 June 2003
    0 references
    zbMATH Keywords
    online scheduling
    0 references
    machine scheduling
    0 references
    competitive ratio
    0 references
    lower bound
    0 references

    Identifiers

    zbMATH DE Number
    1931307
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4706228&oldid=28853852"
    Powered by MediaWiki