Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268)

From MaRDI portal
Revision as of 12:18, 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
Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
scientific article

    Statements

    Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references

    Identifiers