【摘要】 本文考虑一个单一产品仓储能力决策和库存决策的动态批量集成优化问题.在这个模型中,长度为T个周期的计划期被划分成连续的若干段,每段初需制定该段的仓储能力决策,同一段中各期的期末库存水平均受限于该段仓储能力.假设每段仓储能力费用为仓储能力的非减函数,各期的产品订货费用为固定费用,库存保管费用是一个期末库存量的线性函数.利用分解技术和几何技术,本文开发一个计算复杂度为O(T~3)的动态规划算法.计算测试显示,该算法与求解混合整数规划(MIP)的商业软件相比,在计算时间上具有明显的优势.更多还原

【Abstract】 A single item dynamic lot sizing problem integrated with storage capacity and inventory decisions is considered. Given a T-periods planning horizon being partitioned into a series of sections,storage capacity decisions are made at the beginning of each section, and the ending inventory of each period is limited by the storage capacity of section containing it. Assume that section storage capacity cost is a non-decreasing function, ordering cost is a fixed charge, and holding cost is a linear function. By applying decomposition techniques and geometric techniques, an O(T~3) algorithm is presented. Comparing with commercial MIP solver, the saving in computation times of this algorithm is excellent.更多还原