Optimal online algorithms for scheduling on two identical machines under a grade of service (Q2508148)

From MaRDI portal
Revision as of 12:28, 5 August 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
Optimal online algorithms for scheduling on two identical machines under a grade of service
scientific article

    Statements

    Optimal online algorithms for scheduling on two identical machines under a grade of service (English)
    0 references
    0 references
    0 references
    0 references
    9 October 2006
    0 references
    0 references