Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times

DOI10.2298/YJOR160417017EMaRDI QIDQ4987698zbMATH OpenFDO

Authors Ridha Erromdhani, Bassem Jarboui, Mansour Eddaly, Abdelwaheb Rebaï, Nenad Mladenović

Publication date 3 May 2021

Published in Yugoslav Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

production planningmatheuristicvariable neighborhood searchformulation space searchmulti-item lot-sizing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)

Recommendations

• A variable neighborhood search for multi-family capacitated lot-sizing problem
• A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
• A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
• Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
• A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem

Cites work

• A dynamic lot-sizing model with demand time windows
• A recipe for finding good solutions to MINLPs
• An efficient general variable neighborhood search for large travelling salesman problem with time windows
• Attraction probabilities in variable neighborhood search
• Capacitated Multi-Item Lot-Sizing Problems with Time Windows
• Deterministic Production Planning: Algorithms and Complexity
• Developments of variable neighborhood search
• Dynamic version of the economic lot size model
• Formulation Space Search for Circle Packing Problems
• Four equivalent lot-sizing models
• Lot-sizing with production and delivery time windows
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• On the polyhedral structure of a multi-item production planning model with setup times
• Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
• Reformulation descent applied to circle packing problems
• Single item lot sizing problems
• Solving the CLSP by a Tabu Search Heuristic
• The multi-item capacitated lot-sizing problem with setup times and shortage costs
• Variable neighborhood search

Cited in

(5)

• A variable neighborhood search for multi-family capacitated lot-sizing problem
• A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
• A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
• Packing a fixed number of identical circles in a circular container with circular prohibited areas
• Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems

This page was built for publication: Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times

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