Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520)

From MaRDI portal
Revision as of 03:35, 28 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Preemptive online scheduling: Optimal algorithms for all speeds
scientific article

    Statements

    title
    Preemptive online scheduling: Optimal algorithms for all speeds (English)
    0 references
    author
    Tomáš Ebenlendr
    0 references
    Wojciech Jawor
    0 references
    Jiří Sgall
    0 references
    published in
    Algorithmica
    0 references
    publication date
    6 May 2009
    0 references
    zbMATH Keywords
    online algorithms
    0 references
    scheduling
    0 references
    makespan
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90B35
    0 references
    68W20
    0 references
    68W40
    0 references
    zbMATH DE Number
    5551242
    0 references
    OpenAlex ID
    W2594258165
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1016520&oldid=39372633"
    Powered by MediaWiki