Solving the CLSP by a Tabu Search Heuristic

DOI10.1057/JORS.1996.13MaRDI QIDQ4868835zbMATH OpenOpenAlexFDO

Authors Khalil S. Hindi

Publication date 29 April 1996

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

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

zbMATH Keywords

minimum-cost network flowmulti-item, single-level, capacitated, dynamic lot-sizing problemproduction planningtabu searchtrans-shipment

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)

Recommendations

• A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over
• Using Tabu Search in CSPs
• A tabu search approach to the constraint satisfaction problem as a general problem solver
• scientific article; zbMATH DE number 956860
• scientific article; zbMATH DE number 956850
• Solving constraint optimization problems from CLP-style specifications using heuristic search techniques
• An effective heuristic for the CLSP with set-up times
• A tabu search heuristic for the generalized assignment problem
• Theory and Applications of Satisfiability Testing
• Lagrangean tabu search

Cited in

(16)

• Lot sizing and scheduling -- survey and extensions
• Metaheuristics: A bibliography
• An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• Economic lot sizing: the capacity reservation model
• Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
• Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
• A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
• A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry
• Hybrid methods for lot sizing on parallel machines
• An effective heuristic for the CLSP with set-up times
• Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times
• Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
• A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over
• A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches

Describes a project that uses

Uses Software

• RELAX4

This page was built for publication: Solving the CLSP by a Tabu Search Heuristic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868835)