Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/18402
Title: | A Decomposition Algorithm for Robust Lot Sizing Problem with Remanufacturing Option |
Author: | Attila, Öykü Naz Agra, Agostinho Akartunalı, Kerem Arulselvan, Ashwin |
Keywords: | Robust lot sizing Remanufacturing Decomposition |
Issue Date: | 2017 |
Publisher: | Springer International Publishing |
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. |
URI: | http://hdl.handle.net/10773/18402 |
DOI: | 10.1007/978-3-319-62395-5_47 |
ISBN: | 978-3-319-62395-5 |
Appears in Collections: | CIDMA - Capítulo de livro |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
RobustDecomposition_RIA.pdf | Main article | 762.51 kB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.