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

From MaRDI portal
Revision as of 23:11, 17 July 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
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