A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (Q1919357)

From MaRDI portal
Revision as of 13:54, 24 May 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
A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
scientific article

    Statements

    A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 August 1996
    0 references
    0 references
    sequence dependent setup-times
    0 references
    disjunctive graph model
    0 references
    precedence relations
    0 references
    job-shop problem
    0 references
    open-shop problem
    0 references