A branch and bound algorithm for the cyclic job-shop problem with transportation (Q339670)

From MaRDI portal
Revision as of 14:48, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(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 cyclic job-shop problem with transportation
scientific article

    Statements

    A branch and bound algorithm for the cyclic job-shop problem with transportation (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2016
    0 references
    cyclic job-shop
    0 references
    transport
    0 references
    blocking
    0 references
    branch and bound
    0 references
    minimal cycle time
    0 references

    Identifiers