A branch and bound network algorithm for interactive process scheduling (Q3934122)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A branch and bound network algorithm for interactive process scheduling
scientific article

    Statements

    A branch and bound network algorithm for interactive process scheduling (English)
    0 references
    0 references
    1981
    0 references
    branch and bound network algorithm
    0 references
    interactive process scheduling
    0 references
    multi-facility multi-product production scheduling
    0 references
    chemical industry
    0 references
    minimization of total costs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references