On the complexity of bi-criteria scheduling on a single batch processing machine (Q633556)

From MaRDI portal
Revision as of 23:05, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of bi-criteria scheduling on a single batch processing machine
scientific article

    Statements

    On the complexity of bi-criteria scheduling on a single batch processing machine (English)
    0 references
    0 references
    1 April 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    batch processing
    0 references
    bi-criteria
    0 references
    complexity
    0 references
    0 references