An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040)

From MaRDI portal
Revision as of 20:29, 10 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
An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan
scientific article

    Statements

    An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (English)
    0 references
    0 references
    0 references
    4 May 2009
    0 references
    0 references
    scheduling
    0 references
    batching
    0 references
    non-identical job sizes
    0 references
    makespan
    0 references
    asymptotic PTAS
    0 references