Improved bounds for online scheduling with eligibility constraints (Q719259)

From MaRDI portal
Revision as of 02:03, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Improved bounds for online scheduling with eligibility constraints
scientific article

    Statements

    title
    Improved bounds for online scheduling with eligibility constraints (English)
    0 references
    author
    Kyungkuk Lim
    0 references
    Kangbok Lee
    0 references
    Soo Y. Chang
    0 references
    publication date
    10 October 2011
    0 references
    Mathematics Subject Classification ID
    90B35
    0 references
    68M20
    0 references
    68W27
    0 references
    zbMATH DE Number
    5955881
    0 references
    zbMATH Keywords
    online scheduling
    0 references
    parallel machines
    0 references
    eligibility constraints
    0 references
    greedy algorithm
    0 references
    competitive ratio
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q719259&oldid=25742966"
    Powered by MediaWiki