Parallel Taboo Search Techniques for the Job Shop Scheduling Problem (Q4302712)

From MaRDI portal
Revision as of 21:32, 27 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 622152
Language Label Description Also known as
English
Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
scientific article; zbMATH DE number 622152

    Statements

    Parallel Taboo Search Techniques for the Job Shop Scheduling Problem (English)
    0 references
    0 references
    21 August 1994
    0 references
    global optimization
    0 references
    taboo search
    0 references
    job shop scheduling
    0 references
    simulated annealing
    0 references
    polynomial mean time
    0 references

    Identifiers

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