Pages that link to "Item:Q1652102"
From MaRDI portal
The following pages link to Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems (Q1652102):
Displaying 10 items.
- Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints (Q324306) (← links)
- Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach (Q337234) (← links)
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582) (← links)
- A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems (Q1687632) (← links)
- Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing (Q1725608) (← links)
- Robust formulations for economic lot-sizing problem with remanufacturing (Q2028886) (← links)
- Multi-period green reverse logistics network design: an improved Benders-decomposition-based heuristic approach (Q2158031) (← links)
- Towards circular economy in production planning: challenges and opportunities (Q2189927) (← links)
- On multi-item economic lot-sizing with remanufacturing and uncapacitated production (Q2294217) (← links)
- General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain (Q2631230) (← links)
