Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions (Q3166272)

From MaRDI portal
Revision as of 11:07, 1 September 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
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
scientific article

    Statements

    Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2012
    0 references
    scheduling
    0 references
    weighted tardiness
    0 references
    parallel machines
    0 references
    branch-and-boun
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references