A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605)

From MaRDI portal
Revision as of 09:43, 27 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A very fast TS/SA algorithm for the job shop scheduling problem
scientific article

    Statements

    A very fast TS/SA algorithm for the job shop scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 2007
    0 references
    Job shop scheduling problem
    0 references
    tabu search
    0 references
    simulated annealing
    0 references
    makespan
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers