Semi-online preemptive scheduling: one algorithm for all variants (Q537921)

From MaRDI portal
Revision as of 20:00, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Semi-online preemptive scheduling: one algorithm for all variants
scientific article

    Statements

    title
    Semi-online preemptive scheduling: one algorithm for all variants (English)
    0 references
    author
    Tomáš Ebenlendr
    0 references
    Jiří Sgall
    0 references
    publication date
    23 May 2011
    0 references
    Mathematics Subject Classification ID
    68W27
    0 references
    90B35
    0 references
    90C05
    0 references
    zbMATH DE Number
    5898937
    0 references
    zbMATH Keywords
    online algorithms
    0 references
    scheduling
    0 references
    preemption
    0 references
    linear program
    0 references
    OpenAlex ID
    W2114146991
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q537921&oldid=31441747"
    Powered by MediaWiki