Production planning in furniture settings via robust optimization

被引:131
作者
Alem, Douglas Jose [2 ]
Morabito, Reinaldo [1 ]
机构
[1] Univ Fed Sao Carlos, Dept Prod Engn, BR-13565905 Sao Carlos, SP, Brazil
[2] Univ Fed Sao Carlos, Dept Prod Engn, BR-18052780 Sorocaba, SP, Brazil
基金
巴西圣保罗研究基金会;
关键词
Lot-sizing; Cutting-stock; Robust optimization; Furniture industry; CUTTING STOCK;
D O I
10.1016/j.cor.2011.02.022
中图分类号
TP39 [计算机的应用];
学科分类号
080201 [机械制造及其自动化];
摘要
Production planning procedures in small-size furniture companies commonly consists of decisions with respect to production level and inventory policy, while attempting to minimize trim-loss, backlogging and overtime usage throughout the planning horizon. Managing these decisions in a tractable way is often a challenge, especially considering the uncertainty of data. In this study, we employ robust optimization tools to derive robust combined lot-sizing and cutting-stock models when production costs and product demands are uncertainty parameters. Our motivation over the traditional two-stage stochastic programming approach is the absence of an explicit probabilistic description of the input data, as well as avoiding to deal with a large number of scenarios. The results concerning uncertainty in the cost coefficients were illustrative and confirmed previous studies. Regarding uncertainty in product demands, we provide some insights into the relationship between the budgets of uncertainty, fill rates and optimal values. Moreover, when uncertainty affects both costs and demands simultaneously, optimal values are worse for large variability levels. Numerical evidence indicated that less conservative budgets of uncertainty result in reasonable service levels with cheaper global costs, while worst-case deterministic approaches generate relatively good fill rates, but with prohibitive global costs. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:139 / 150
页数:12
相关论文
共 28 条
[1]
A robust optimization approach to dynamic pricing and inventory control with no backorders [J].
Adida, E ;
Perakis, G .
MATHEMATICAL PROGRAMMING, 2006, 107 (1-2) :97-129
[2]
Dynamic pricing and inventory control: robust vs. stochastic uncertainty models-a computational study [J].
Adida, Elodie ;
Perakis, Georgia .
ANNALS OF OPERATIONS RESEARCH, 2010, 181 (01) :125-157
[3]
Alem DJ, 2011, THESIS U SAO PAULO S
[4]
[Anonymous], 1997, Introduction to stochastic programming
[5]
Robust convex optimization [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (04) :769-805
[6]
Robust solutions of Linear Programming problems contaminated with uncertain data [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2000, 88 (03) :411-424
[7]
Adjustable robust solutions of uncertain linear programs [J].
Ben-Tal, A ;
Goryashko, A ;
Guslitzer, E ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2004, 99 (02) :351-376
[8]
Robust solutions of uncertain linear programs [J].
Ben-Tal, A ;
Nemirovski, A .
OPERATIONS RESEARCH LETTERS, 1999, 25 (01) :1-13
[9]
A robust optimization approach to inventory theory [J].
Bertsimas, D ;
Thiele, A .
OPERATIONS RESEARCH, 2006, 54 (01) :150-168
[10]
The price of robustness [J].
Bertsimas, D ;
Sim, M .
OPERATIONS RESEARCH, 2004, 52 (01) :35-53