Minimizing total tardiness in an unrelated parallel-machine scheduling problem (Q5428943)

From MaRDI portal
Revision as of 08:46, 24 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5215811
Language Label Description Also known as
English
Minimizing total tardiness in an unrelated parallel-machine scheduling problem
scientific article; zbMATH DE number 5215811

    Statements

    Minimizing total tardiness in an unrelated parallel-machine scheduling problem (English)
    0 references
    0 references
    0 references
    29 November 2007
    0 references
    scheduling
    0 references
    unrelated parallel machines
    0 references
    total tardiness
    0 references
    branch and bound
    0 references

    Identifiers