Improved bounds for online scheduling with eligibility constraints (Q719259)

From MaRDI portal
Revision as of 21:33, 4 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Improved bounds for online scheduling with eligibility constraints
scientific article

    Statements

    Improved bounds for online scheduling with eligibility constraints (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    online scheduling
    0 references
    parallel machines
    0 references
    eligibility constraints
    0 references
    greedy algorithm
    0 references
    competitive ratio
    0 references