No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557)

From MaRDI portal
Revision as of 01:01, 5 August 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
No-wait job shop scheduling: tabu search and complexity of subproblems
scientific article

    Statements

    No-wait job shop scheduling: tabu search and complexity of subproblems (English)
    0 references
    6 March 2008
    0 references
    Scheduling
    0 references
    job shop
    0 references
    no-wait
    0 references
    decomposition
    0 references
    complexity
    0 references
    tabu search
    0 references
    flow shop
    0 references

    Identifiers