Preemptive scheduling of two uniform parallel machines to minimize total tardiness (Q439607)

From MaRDI portal
Revision as of 14:17, 5 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
Preemptive scheduling of two uniform parallel machines to minimize total tardiness
scientific article

    Statements

    Preemptive scheduling of two uniform parallel machines to minimize total tardiness (English)
    0 references
    16 August 2012
    0 references
    0 references
    scheduling
    0 references
    uniform machines
    0 references
    total tardiness
    0 references
    polynomial algorithm
    0 references
    0 references