论文部分内容阅读
有效组织带转包的采购计划对企业提高竞争力和参与全球产业分工有重要意义。研究了一个新的非减库存能力约束下的允许缺货和转包的企业采购计划模型,提出了一个基于动态规划的多项式算法。引入子计划概念,将问题归结为有效计算子计划;依据最优解的性质设计了求解子计划的多项式算法;再通过动态规划算法以多项式时间枚举所有可能子计划组合,得到问题的最优解。数值试验显示了该算法的有效性及高效性。
Effective organization of the procurement plan with subcontracting is of great significance for enterprises to enhance their competitiveness and participate in the global division of labor. This paper studies a new purchasing plan model that allows out-of-stock and out-of-stock under the constraint of non-inventory-reducing ability and proposes a polynomial algorithm based on dynamic programming. The concept of subprogram is introduced, and the problem is reduced to an effective subprogram. The polynomial algorithm for solving subprogram is designed according to the nature of the optimal solution. Then all the possible subprogram combinations are enumerated by the dynamic programming algorithm in polynomial time to obtain the optimal problem solution. Numerical experiments show the effectiveness and efficiency of the algorithm.