Robust optimization for lot-sizing problems under yield uncertainty

被引:17
作者
Metzker, Paula [1 ,2 ]
Thevenin, Simon [1 ]
Adulyasak, Yossiri [2 ]
Dolgui, Alexandre [1 ]
机构
[1] CNRS, UMR 6004, IMT Atlantique, LS2N, F-44307 Nantes, France
[2] HEC Montreal, Montreal, PQ, Canada
关键词
Lot-sizing; Production; Uncertainty; Robust optimization; PROGRAMMING APPROACH; DEMAND; MODEL; STRATEGIES; SYSTEM; ORDER;
D O I
10.1016/j.cor.2022.106025
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Production yield can be highly volatile and uncertain, especially in industries where exogenous and environ-mental factors such as the climate or raw material quality can impact the manufacturing process. Thus, for production planning, it is necessary to take into account the production yield uncertainty to obtain robust and efficient plans. In this paper, we consider lot-sizing problems under yield uncertainty. We propose a multi-period, single-item lot-sizing problem with backorder and yield uncertainty via a robust optimization methodology. First, we formulate a robust model under a budgeted uncertainty set, which is optimized under the worst case perspective to ensure the feasibility of the proposed plan for any realization of the yield described by the uncertainty set. Second, we analyze the structure of the optimal lot-sizing solution, and we derive the optimal robust policy for the special case of the inventory management problem under a box uncertainty. These results help us develop a dynamic program with polynomial complexity for the lot-sizing problem with stationary yield rate. Finally, extensive computational experiments show the robustness and effectiveness of the proposed model through an average and worst case analyses. The results demonstrate that the robust approach immunizes the system against uncertainty. Moreover, a comparison of the robust model with the nominal model, the deterministic model with safety stock, and the stochastic model shows that the robust model balances the costs better by reducing the backorders at the expense of more often producing a larger amount of goods.
引用
收藏
页数:16
相关论文
共 67 条
[1]   The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs [J].
Absi, Nabil ;
Kedad-Sidhoum, Safia .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (11) :2926-2936
[2]   A DYNAMIC PROGRAMMING APPROACH FOR A CLASS OF ROBUST OPTIMIZATION PROBLEMS [J].
Agra, Agostinho ;
Santos, Marcio Costa ;
Nace, Dritan ;
Poss, Michael .
SIAM JOURNAL ON OPTIMIZATION, 2016, 26 (03) :1799-1823
[3]   PART DISPATCH IN RANDOM YIELD MULTISTAGE FLEXIBLE TEST SYSTEMS FOR PRINTED-CIRCUIT BOARDS [J].
AKELLA, R ;
RAJAGOPALAN, S ;
SINGH, MR .
OPERATIONS RESEARCH, 1992, 40 (04) :776-789
[4]   A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches [J].
Alem, Douglas ;
Curcio, Eduardo ;
Amorim, Pedro ;
Almada-Lobo, Bernardo .
COMPUTERS & OPERATIONS RESEARCH, 2018, 90 :125-141
[5]   A bibliography of non-deterministic lot-sizing models [J].
Aloulou, Mohamed Ali ;
Dolgui, Alexandre ;
Kovalyov, Mikhail Y. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (08) :2293-2310
[6]   Contract design in agriculture supply chains with random yield [J].
Anderson, Edward ;
Monjardino, Marta .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 277 (03) :1072-1082
[7]   Robust formulations for economic lot-sizing problem with remanufacturing [J].
Attila, Oeykue Naz ;
Agra, Agostinho ;
Akartunah, Kerem ;
Arulselvan, Ashwin .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 288 (02) :496-510
[8]   Duality in robust optimization: Primal worst equals dual best [J].
Beck, Amir ;
Ben-Tal, Aharon .
OPERATIONS RESEARCH LETTERS, 2009, 37 (01) :1-6
[9]   Robust solutions of Linear Programming problems contaminated with uncertain data [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2000, 88 (03) :411-424
[10]   Retailer-supplier flexible commitments contracts: A robust optimization approach [J].
Ben-Tal, Aharon ;
Golany, Boaz ;
Nemirovski, Arkadi ;
Vial, Jean-Philippe .
Manufacturing and Service Operations Management, 2005, 7 (03) :248-271