Lot-sizing for production planning in a recovery system with returns
From MaRDI portal
Publication:5247676
DOI10.1051/ro/2014044zbMath1310.90040OpenAlexW2084175683MaRDI QIDQ5247676
Kamal Eddin El Kadiri, Mohamed Reghioui, Tarik Zouadi, Alice Yalaoui
Publication date: 27 April 2015
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2014044
Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Dynamic lot sizing for multiple products with a new joint replenishment model
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- Production, remanufacturing and waste disposal models for the cases of pure and partial backordering
- Lot sizing with carbon emission constraints
- Optimal stationary policies in a 3-stage serial production-distribution logistic chain facing constant and continuous demand
- Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand
- Single item lot sizing problems
- Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales
- Dynamic lot sizing with product returns and remanufacturing
- A memetic algorithm for the vehicle routing problem with time windows
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- A GRASP with path-relinking for private virtual circuit routing
This page was built for publication: Lot-sizing for production planning in a recovery system with returns
