A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over

DOI10.1057/palgrave.jors.2601968zbMath1090.90204OpenAlexW2074623045MaRDI QIDQ5200785

John M. Wilson, Behrooz Karimi, Seyyed Mohammad Taghi Fatemi Ghomi

Publication date: 11 April 2006

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601968

zbMATH Keywords

tabu searchnetwork flowsbackloggingcapacitated lot sizingset-up carry-over

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (7)

Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints ⋮ A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times ⋮ Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem ⋮ Capacitated lot-sizing with extensions: a review ⋮ An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging ⋮ Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over

This page was built for publication: A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over