Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets (Q4230222)

From MaRDI portal
Revision as of 18:47, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1256537
Language Label Description Also known as
English
Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets
scientific article; zbMATH DE number 1256537

    Statements

    Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets (English)
    0 references
    1 March 1999
    0 references
    0 references
    heuristic approaches
    0 references
    multi-level, single-machine lot sizing
    0 references
    randomized regret
    0 references
    tabu search
    0 references
    0 references
    0 references
    0 references
    0 references