Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
From MaRDI portal
Publication:1725608
DOI10.1016/j.cor.2018.12.012zbMath1458.90014OpenAlexW2903981941WikidataQ128756066 ScholiaQ128756066MaRDI QIDQ1725608
Rafael A. Melo, Hugo Harry Kramer, Jesus Ossian Cunha
Publication date: 14 February 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.12.012
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05)
Related Items
An effective multi-objective particle swarm optimization for the multi-item capacitated lot-sizing problem with set-up times and backlogging ⋮ A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem ⋮ Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection ⋮ Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem ⋮ Integrated disassembly and reprocessing lot-sizing for multi-level structured products in remanufacturing systems ⋮ Matheuristics: survey and synthesis ⋮ Towards circular economy in production planning: challenges and opportunities ⋮ Cost minimizing planning of container inspection and repair in multiple facilities ⋮ A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic
Cites Work
- Unnamed Item
- A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery
- A variable neighborhood search based matheuristic for nurse rostering problems
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- A heuristic approach for big bucket multi-level production planning problems
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
- On multi-item economic lot-sizing with remanufacturing and uncapacitated production
- A survey on matheuristics for routing problems
- Decomposition Principle for Linear Programs
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Dynamic lot sizing with product returns and remanufacturing
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
- Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- MIP‐and‐refine matheuristic for smart grid energy management
