Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407)

From MaRDI portal
Revision as of 00:02, 6 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
Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
scientific article

    Statements

    Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2012
    0 references
    0 references
    batch scheduling
    0 references
    non-identical job sizes
    0 references
    parallel machines
    0 references
    approximation algorithm
    0 references
    0 references