The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160)

From MaRDI portal
Revision as of 12:44, 7 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
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
scientific article

    Statements

    The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (English)
    0 references
    0 references
    0 references
    0 references
    28 May 2008
    0 references
    0 references
    scheduling
    0 references
    rejection penalty
    0 references
    fully polynomial-time approximation scheme
    0 references