A decomposition algorithm for robust lot sizing problem with remanufacturing option

Attila, Öykü Naz and Agra, Agostinho and Akartunali, Kerem and Arulselvan, Ashwin; Gervasi, Osvaldo, ed. (2017) A decomposition algorithm for robust lot sizing problem with remanufacturing option. In: Computational Science and its Applications - ICCSA 2017. Lecture Notes in Computer Science, 10405 . Springer, ITA, pp. 684-695. ISBN 9783319623948 (https://doi.org/10.1007/978-3-319-62395-5_47)

[thumbnail of Atilla-etal-ICCSA2017-A-decomposition-algorithm-for-robust-lot-sizing-problem]
Preview
 Text. Filename: Atilla_etal_ICCSA2017_A_decomposition_algorithm_for_robust_lot_sizing_problem.pdf
Accepted Author Manuscript
Download (754kB)| Preview

Abstract

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 Özbay (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.

ORCID iDs

Attila, Öykü Naz ORCID logoORCID: https://orcid.org/0000-0002-8055-9052, Agra, Agostinho, Akartunali, Kerem ORCID logoORCID: https://orcid.org/0000-0003-0169-3833 and Arulselvan, Ashwin ORCID logoORCID: https://orcid.org/0000-0001-9772-5523; Gervasi, Osvaldo
CORE (COnnecting REpositories)