Optimization of (s, S) Inventory Systems with Random Lead Times and a Service Level Constraint
研究允许订单交叉的(s, S)库存系统，在服务水平约束下提出基于仿真的可行方向优化方法，多数测试案例结果接近最优解的5%以内。
A major assumption in the analysis of (s, S) inventory systems with stochastic lead times is that orders are received in the same sequence as they are placed. Even under this assumption, much of the work to date has focused on the unconstrained optimization of the system, in which a penalty cost for unsatisfied demand is assigned. The literature on constrained optimization, wherein a service level requirement needs to be met, is more sparse. In this paper, we consider the constrained optimization problem, where orders are allowed to cross in time. We propose a feasible directions procedure that is simulation based, and present computational results for a large number of test cases. In the vast majority of cases, we come within 5% of estimated optimality.