A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery
From MaRDI portal
Publication:336916
DOI10.1016/j.cor.2013.10.001zbMath1348.90218OpenAlexW1985835923MaRDI QIDQ336916
Ben A. Chaouch, Walid Abdul-Kader, Mohammed Fazle Baki
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.10.001
Related Items (7)
Capacitated dynamic production and remanufacturing planning under demand and return uncertainty ⋮ Towards circular economy in production planning: challenges and opportunities ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing ⋮ Heuristic policies for the stochastic economic lot sizing problem with remanufacturing under service level constraints ⋮ A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems ⋮ Robust formulations for economic lot-sizing problem with remanufacturing
Cites Work
- Quantitative models for reverse logistics: A review
- Periodic review, push inventory policies for remanufacturing.
- Remanufacturing planning for the reverse Wagner/Whitin models
- Inventory policies for the economic lot-sizing problem with remanufacturing and final disposal options
- Inventory Control in Hybrid Systems with Remanufacturing
- Dynamic lot sizing with product returns and remanufacturing
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Optimum Solution Structure for a Repairable Inventory Problem
- Improved Algorithms for Economic Lot Size Problems
- A reverse logistics valuation method for inventory control
- OR FORUM—The Evolution of Closed-Loop Supply Chain Research
- A concave-cost production planning problem with remanufacturing options
This page was built for publication: A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery