Xiang, MengyuanRossi, RobertoMartin-Barragan, BelenTarim, S. Armagan2018-09-192018-09-192018Xiang, M., Rossi, R., Martin-Barragan, B., Tarım, S.A. (2018). Computing non-stationary (s, S) policies using mixed integer linear programming. European Journal of Operational Research, 271(2), 490-500. http://dx.doi.org/10.1016/j.ejor.2018.05.0300377-22171872-6860https://doi.org/10.1016/j.ejor.2018.05.030Tarim, S. Armagan/0000-0001-5601-3968; Rossi, Roberto/0000-0001-7247-1010; Martin-Barragan, Belen/0000-0003-4807-2700This paper addresses the single-item single-stocking location non-stationary stochastic lot sizing problem under the (s, S) control policy. We first present a mixed integer non-linear programming (MINLP) formulation for determining near-optimal (s, S) policy parameters. To tackle larger instances, we then combine the previously introduced MINLP model and a binary search approach. These models can be reformulated as mixed integer linear programming (MILP) models which can be easily implemented and solved by using off-the-shelf optimization software. Computational experiments demonstrate that optimality gaps of these models are less than 0.3% of the optimal policy cost and computational times are reasonable. (C) 2018 Elsevier B.V. All rights reserved.eninfo:eu-repo/semantics/openAccessInventory(S, S) PolicyStochastic Lot-SizingMixed Integer ProgrammingBinary SearchArticle271249050010.1016/j.ejor.2018.05.0302-s2.0-85048834894WOS:000440960300009Q1Q1