A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops (Q1260741)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
scientific article

    Statements

    A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops (English)
    0 references
    0 references
    25 August 1993
    0 references
    0 references
    two-machine flowshop scheduling
    0 references
    lower bounds
    0 references
    branch and bound
    0 references