进货量受限的运输和库存整合的批量问题

考虑由一个分销中心和一个零售商组成的单一产品两级动态经济批量问题,其中零售商在每一进货期的进货量都具有数量限制.目的是确定分销中心和零售商分别在什么时期进货以及进多少单位的货物,从而使分销中心和零售商的运输费用和库存费用总和最小.分析了最优解的性质,并且利用动态规划和最短路问题在O（n5）时间内解决了此问题.最后给出了此算法的一个算例,表明此算法是可行有效的.

A Dynamic Model for Inventory Lot-sizing and Outbound Shipment Scheduling with a Minimum Order Amount Constraint

In this paper, we consider a two-echelon dynamic lot-sizing problem about a distribution center and a retailer where the distribution center stipulates a minimum order from the retailer. The aim is to decide the re- plenishment amount for distribution center and retailer respectively in order to minimize the transportation cost and inventory cost. Studying the optimality properties of the problem, we provide a polynomial solution algorithm based on dynamic programming and shortest path problem in O（n5） time. Finally, a simple example is given to show the effectiveness of this algorithm.