A branch and bound algorithm for the two-stage assembly scheduling problem (Q1280185)

From MaRDI portal
Revision as of 04:42, 6 March 2024 by Import240305080351 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A branch and bound algorithm for the two-stage assembly scheduling problem
scientific article

    Statements

    A branch and bound algorithm for the two-stage assembly scheduling problem (English)
    0 references
    0 references
    0 references
    6 October 1999
    0 references
    branch and bound
    0 references
    two-stage assembly scheduling
    0 references
    maximum completion time
    0 references
    makespan
    0 references

    Identifiers