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

From MaRDI portal
Revision as of 12:41, 20 June 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 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

    Identifiers