柔性自动化车间生产计划的最优分解

Optimal Decomposition of Production Plans in Flexible Automated Workshops

中文关键词  柔性自动化车间  生产计划  卡马卡算法  关联预测法

英文关键词  flexible automated workshop  production planning  Karmarkar's algorithm  interaction/prediction approach

中文摘要

      研究了柔性自动化车间生产计划的最优分解问题. 首先根据实际需要建立车间生产计划的非线性规划模型, 然后为求解方便将其转化成线性规划模型. 由于这种模型对于一般车间来讲其规模已经很大, 很难在微机上用单纯形法求解. 为此, 提出分别用卡马卡算法和一种新的基于卡马卡算法的关联预测法来求解车间生产计划的最优分解问题, 并编制了相应软件. 最后通过算例研究, 比较了卡马卡算法、基于卡马卡算法的关联预测法和Matlab中的线性规划法, 结果表明所提方法是非常有效的.

英文摘要

      The paper addresses the prodlem of the optimal decomposition of production plans in flexible automated workshops. A nonlinear programming model of production planning in a workshop is built up and then transformed into a linear programming model. Because the scale of the model for a general workshop is too large to be solved in simplex method on a microcomputer, a Karmarkar's algorithm and a new interaction/prediction algorithm are used to solve the model,on the basis of which the corresponding programs have been written. Through prodution planning examples, the Karmarkar's algorithm, interaction/prediction algorithm and linear programming method in Matlab are compared, thus showing that the proposed approaches are very effective.