Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times
DOI10.2298/YJOR160417017EzbMath1474.90044MaRDI QIDQ4987698
Ridha Erromdhani, Bassem Jarboui, Nenad Mladenović, Mansour Eddaly, Abdelwaheb Rebaï
Publication date: 3 May 2021
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
production planningvariable neighborhood searchmatheuristicformulation space searchmulti-item lot-sizing
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items (1)
Cites Work
- Unnamed Item
- A recipe for finding good solutions to MINLPs
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Attraction probabilities in variable neighborhood search
- Four equivalent lot-sizing models
- Variable neighborhood search
- On the polyhedral structure of a multi-item production planning model with setup times
- Reformulation descent applied to circle packing problems
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- Lot-sizing with production and delivery time windows
- Single item lot sizing problems
- Dynamic Version of the Economic Lot Size Model
- A Dynamic Lot-Sizing Model with Demand Time Windows
- Capacitated Multi-Item Lot-Sizing Problems with Time Windows
- Deterministic Production Planning: Algorithms and Complexity
- Solving the CLSP by a Tabu Search Heuristic
- An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
- Formulation Space Search for Circle Packing 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
