Multi-Item, One-Warehouse, Multi-Retailer Distribution Systems
研究单仓库多零售商系统中多物品的采购与配送协调问题，提出一种基于排序的高效算法，其成本不超过最优嵌套策略的6%。
In this paper we study the problem of coordinating the purchase and shipment of I items in a one-warehouse, N-retailer inventory system. The model includes positive echelon holding costs, fixed costs for ordering and shipping each item, and a fixed joint item order cost at each retailer. Demand for each item at each retailer is assumed to occur at a constant and continuous rate. A mathematical model is developed based on these assumptions and the assumption that a stationary nested policy is followed. An efficient algorithm is presented based on the problem's structure that involves only sorting and runs in O(NI log NI) time. The cost of the policy computed is proven to be within 6% of the cost of an optimal nested policy. An example is presented to illustrate the problem structure and the proposed algorithm.