A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
scientific article

    Statements

    A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (English)
    0 references
    0 references
    0 references
    0 references
    1 September 2008
    0 references
    lower bound
    0 references
    dominance properties
    0 references
    0 references
    0 references

    Identifiers