Service Constrained (s, S) Inventory Systems with Priority Demand Classes and Lost Sales
研究了一个有两类优先客户的(s, S)库存系统，考虑销售损失和任意固定提前期，提出了一个基于更新的近似模型和贪婪启发式算法，在满足订单满足率约束下最小化期望成本，数值测试表明算法表现良好。
This paper presents a model of an (s, S) inventory system in which there are two priority classes of customers. The model treats excess demands as lost sales and can accommodate an arbitrary deterministic lead time. After considering the associated Markov-chain model, an approximate, renewal-based model is derived. This approximation is used to develop a greedy heuristic which minimizes expected costs subject to a fill-rate service constraint. The paper concludes with the results of an extensive numerical test of both the accuracy of the approximation and the performance of the heuristic with respect to the true optimal solution. Results indicate good performance which deteriorates as the fill rate requirement and lead time increase.