A Decomposition Algorithm for Robust Lot Sizing Problem with Remanufacturing Option

In this paper, we propose a decomposition procedure for constructing robust optimal production plans for reverse inventory systems. Our method is motivated by the need of overcoming the excessive computational time requirements, as well as the inaccuracies caused by imprecise representations of problem parameters. The method is based on a min-max formulation that avoids the excessive conservatism of the dualization technique employed by Wei et al. (2011). We perform a computational study using our decomposition framework on several classes of computer generated test instances and we report our experience. Bienstock and Ozbay (2008) computed optimal base stock levels for the traditional lot sizing problem when the production cost is linear and we extend this work here by considering return inventories and setup costs for production. We use the approach of Bertsimas and Sim (2004) to model the uncertainties in the input.

[1]  Tara L. Terry,et al.  Robust Linear Optimization With Recourse , 2009 .

[2]  Wilco van den Heuvel,et al.  Economic lot-sizing with remanufacturing: complexity and efficient formulations , 2010 .

[3]  Alper Atamtürk,et al.  Two-Stage Robust Network Flow and Design Under Demand Uncertainty , 2007, Oper. Res..

[4]  Xiaoqiang Cai,et al.  Robust optimal policies of production and inventory with uncertain returns and demand , 2011 .

[5]  Allen L. Soyster,et al.  Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..

[6]  Long Zhao,et al.  Solving two-stage robust optimization problems using a column-and-constraint generation method , 2013, Oper. Res. Lett..

[7]  Dick den Hertog,et al.  A practical guide to robust optimization , 2015, 1501.02634.

[8]  V. Daniel R. Guide,et al.  OR FORUM - The Evolution of Closed-Loop Supply Chain Research , 2009, Oper. Res..

[9]  Jian Yang,et al.  Economic Lot-Sizing with Remanufacturing Options , 2001 .

[10]  K. Richter,et al.  The reverse Wagner/Whitin model with variable manufacturing and remanufacturing cost , 2001 .

[11]  Marielle Christiansen,et al.  The robust vehicle routing problem with time windows , 2013, Comput. Oper. Res..

[12]  Dritan Nace,et al.  A Dynamic Programming Approach for a Class of Robust Optimization Problems , 2016, SIAM J. Optim..

[13]  Cécile Murat,et al.  Recent advances in robust optimization: An overview , 2014, Eur. J. Oper. Res..

[14]  Ruud H. Teunter,et al.  Dynamic lot sizing with product returns and remanufacturing , 2006 .

[15]  Constantine Caramanis,et al.  Theory and Applications of Robust Optimization , 2010, SIAM Rev..

[16]  Dimitris Bertsimas,et al.  A Robust Optimization Approach to Inventory Theory , 2006, Oper. Res..

[17]  Daniel Bienstock,et al.  Computing robust basestock levels , 2008, Discret. Optim..

[18]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[19]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

[20]  Ashwin Arulselvan,et al.  Economic Lot-Sizing Problem with Remanufacturing Option: Complexity and Algorithms , 2016, MOD.

[21]  V AgrawalVishal,et al.  Remanufacturing, Third-Party Competition, and Consumers' Perceived Value of New Products , 2015 .

[22]  Tao Wu,et al.  Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems , 2010, INFORMS J. Comput..

[23]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[24]  Atalay Atasu,et al.  Remanufacturing, Third-Party Competition, and Consumers' Perceived Value of New Products , 2012, Manag. Sci..

[25]  Marc Salomon,et al.  Strategic Issues in Product Recovery Management , 1995 .

[26]  Knut Richter,et al.  Remanufacturing planning for the reverse Wagner/Whitin models , 2000, Eur. J. Oper. Res..