Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308)

From MaRDI portal
Revision as of 05:55, 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
Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
scientific article

    Statements

    Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    16 May 2006
    0 references
    Tabu search
    0 references
    Metaheuristics
    0 references
    Job-shop scheduling
    0 references
    Empirical analysis
    0 references

    Identifiers