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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 22:40, 30 January 2024

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