This paper deals with the production planning and control problem of a single product involving combined manufacturing and remanufacturing operations. We investigate here a lot-sizing problem in which the demand for items can be satisfied by both the new and the remanufactured products. We assume that produced and recovered items are of the same quality. Two types of inventories are involved in this problem. The produced items are stored in the first inventory. The returned products are collected in the second inventory and then remanufactured. The objective of this study is to propose a manufacturing/remanufacturing policy that would minimize the holding, the set up and preparation costs. The decision variables are the manufacturing and the remanufacturing rates. The paper proposes an extension of the reverse Wagner/Whitin dynamic production planning and inventory control model, a Memetic Algorithm (MA) and a Hybrid Algorithm (HA). The HA was improved with a post-optimization procedure using Path Relinking. Numerical experiments were conducted on a set of 300 instances with up to 48 periods. The results show that both methods give high-quality solutions in moderate computational time.
Mots-clés : Lot-sizing, remanufacturing, genetic algorithm, GRASP, path relinking
@article{RO_2015__49_1_123_0,
author = {Zouadi, Tarik and Yalaoui, Alice and Reghioui, Mohamed and El Kadiri, Kamal Eddin},
title = {Lot-sizing for production planning in a recovery system with returns},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {123--142},
publisher = {EDP-Sciences},
volume = {49},
number = {1},
year = {2015},
doi = {10.1051/ro/2014044},
mrnumber = {3349120},
zbl = {1310.90040},
language = {en},
url = {http://www.numdam.org/articles/10.1051/ro/2014044/}
}
TY - JOUR AU - Zouadi, Tarik AU - Yalaoui, Alice AU - Reghioui, Mohamed AU - El Kadiri, Kamal Eddin TI - Lot-sizing for production planning in a recovery system with returns JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2015 SP - 123 EP - 142 VL - 49 IS - 1 PB - EDP-Sciences UR - http://www.numdam.org/articles/10.1051/ro/2014044/ DO - 10.1051/ro/2014044 LA - en ID - RO_2015__49_1_123_0 ER -
%0 Journal Article %A Zouadi, Tarik %A Yalaoui, Alice %A Reghioui, Mohamed %A El Kadiri, Kamal Eddin %T Lot-sizing for production planning in a recovery system with returns %J RAIRO - Operations Research - Recherche Opérationnelle %D 2015 %P 123-142 %V 49 %N 1 %I EDP-Sciences %U http://www.numdam.org/articles/10.1051/ro/2014044/ %R 10.1051/ro/2014044 %G en %F RO_2015__49_1_123_0
Zouadi, Tarik; Yalaoui, Alice; Reghioui, Mohamed; El Kadiri, Kamal Eddin. Lot-sizing for production planning in a recovery system with returns. RAIRO - Operations Research - Recherche Opérationnelle, Special ROADEF 2013, Tome 49 (2015) no. 1, pp. 123-142. doi : 10.1051/ro/2014044. http://www.numdam.org/articles/10.1051/ro/2014044/
and , MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs. RAIRO–Oper. Res. 41 (2007) 171–192. | DOI | Numdam | MR | Zbl
, , , and , Lot sizing with carbon emission constraints. Eur. J. Oper. Res. 227 (2013) 55-61. | DOI | MR | Zbl
, and , Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales, Int. J. Prod. Res. Special Issue: Lot sizing and scheduling: new models and solution approaches to address industrial extensions 49 (2011) 2551–2566. | DOI | Zbl
, A hybrid optimization approach for multi-level capacitated lot-sizing problems. Eur. J. Oper. Res. 200 (2010) 599–606. | DOI | Zbl
, and , Lot-sizing in a serial distribution system with capacitated in-system production flow. Int. J. Prod. Econ. 112 (2008) 483–494. | DOI
, , and , Single item lot sizing problems. Eur. J. Oper. Res. 168 (2006) 1–16. | DOI | MR | Zbl
, and , Reverse logistics: A review of case studies. Lecture Notes in Economics and Mathematical Systems 544 (2005) 243–281. | DOI | Zbl
S. Fernandes and H.R. Lourenço, Hybrids combining local search heuristics with exact algorithms, in Proceeding of the V Congreso Español sobre Metaheurísticas. Algoritmos Evolutivos y Bioinspirados, MAEB’2007, February 14-16 (2007) 269–274.
, and , Integrating Closed-Loop Supply Chains and Spare-Parts Management at IBM. Interfaces 33 (2003) 44–56. | DOI
, and , A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times. Eur. J. Oper Res. 218 (2012) 614–623. | DOI | MR | Zbl
and , . A review of applications of genetic algorithms in lot sizing. J. Intelligent Manufacturing 21 (2010) 575–590. | DOI
, Production planning and control for remanufacturing: Industry practice and research needs. J. Oper. Manag. 18 (2000) 467–483. | DOI
, and , Reverse logistics strategies for end-of-life products. Int. J. Logistics Manage. 19 (2008) 367–388. | DOI
, and , production, remanufacturing and waste disposal models for the cases of pure and partial backordering. Appl. Math. Model. 36 (2012) 5249–5261. | DOI | MR | Zbl
and , Production planning and control for remanufacturing: literature review and analysis. Production planning & control. Manage. Oper. 23 (2012) 419–435.
, and , Lot sizing for a recoverable product with inspection and sorting. Comput. Indust. Eng. 58 (2010) 452–462. | DOI
, and , The impact of product life cycle management on circular supply chains - and reverse. Icfaian J. Manage. Res. 3 (2004) 7–31.
, and , A memetic algorithm for the vehicle routing problem with time windows. RAIRO–Oper. Res. 42 (2008) 415–431. | DOI | Numdam | MR | Zbl
and , Dynamic lot sizing for multiple products with a new joint replenishment model. Eur. J. Oper. Res. 212 (2011) 74–80. | DOI | MR | Zbl
and , GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization. INFORMS J. Comput. 11 (1999) 44–52. | DOI | Zbl
, and , Special issue of Computers and Operations Research: GRASP with Path Relinking, Developments and applications. Comput. Oper. Res. 40 (2013) 3080. | DOI
, , , Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand. Eur. J. Oper. Res. 234 (2014) 641–649. | DOI | MR | Zbl
, and , GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem. Eur. J. Oper. Res. 200 (2010) 747–754. | DOI | Zbl
and , Memetic algorithms and memetic computing optimization: A literature review. Swarm and Evolutionary Computation 2 (2012) 114. | DOI
and , The economic lot-sizing problem with remanufacturing and one-way substitution. Int. J. Prod. Econ. 124 (2012) 482–488. | DOI
J. Puchinger and G.R. Raidl, Combining metaheuristics and exact algorithms in combinatorial optimization: survey and classification, in Proceedings of the first international work-conference on the interplay between Natural and artificial computation, edited by J. Mira and J.R. Alvarez, vol. 3562 (2005) 41–53.
and , Meta-Heuristics for Dynamic Lot Sizing: A Review and Comparison of Solution Approaches (24 (2004) 6,). ERIM Report Series Reference No. ERS-2004-042-LIS. J. Oper. Res. 234 (2014) 641–649.
and , A GRASP with path-relinking for private virtual circuit routing. Networks 41 (2003) 104–114. | DOI | MR | Zbl
D.S. Rogers and R.S. Tibben-Lembke, Going backwards: reverse logistics trends and practices. University of Nevada. Reno Center for Logistics Management. Reverse Logistics Executive Council (1998) 101–115.
, A new Silver-Meal based heuristic for the single-item dynamic lot sizing problem with returns and remanufacturing. Int. J. Prod. Res. 49 (2011) 2519–2533. | DOI
and , A flexibly structured lot sizing heuristic for a static remanufacturing system. Omega 44 (2014) 21–31. | DOI
and , Dynamic lot-sizing problems: A Review on Model and Efficient Algorithm. Agroindust. J. 1 (2012) 36–49. | DOI
, and , Dynamic lot sizing with product returns and remanufacturing. Int. J. Prod. Res. 44 (2006) 4377–4400. | DOI | Zbl
N. Wang, Z. He, J. Sun, H. Xie and W. Shi, A single-item incapacitated lot-sizing problem with remanufacturing and outsourcing. Procedia Engineer. (2011) 5170–5178.
and , Mathematical models for capacitated multi-level production planning problems with linked lot sizes. Int. J. Prod. Res. 49 (2011) 6227–6247. | DOI
Cité par Sources :
