以正好满足产品需求为约束条件的车间最优生产计划

研究以正好满足产品需求为约束条件的预选性自动化车间（FAW)伯最优生产计划问题,首先根据实际需要建立车间生产计划的含需求约束的非线性规划模型,然后为求解方便通过引进约束将其转化成线性规划模型,由于这种模型对于一般车间来讲其规模已经很大,很难在微机上用单纯形法在可接受的时间内获得其最优解,为此,提出分别用卡马卡算法和基于卡马卡算法的关联预测法来求解车间最优生产计划问题,并编制了相应软件,最后,通过算例研究,比较了卡马卡算法,基于卡马卡算法的关联预测法和Ｍatlab中的线性规划法,结果表明所提方法非常适合将ＥＲＰ／ＭＲＰＩＩ下达给ＦＡＷ的中期计划最优分解成由ＦＡＷ中各ＦＭＳ执行的短期计划。

Optimal productionplanning for workshops with demand constraints

The paper explores the problem of the optimal production planningin flexible automa- ted workshops(FAWs) under the condition of demands'being just sa t isfied. A nonlinear programming model of production planning with demand constra ints is built up and then transformed into a linear programming model by adding constraints. Because the scale of the model for a general workshop is too large to be solved in simplex method on a microcomputer within accep-table time, a Karmarkar's algorithm and an interaction/prediction algorithm are used to solve the model, on the basis of which the corresponding programs have been written.T hrough production planning examples, the Karmarkar's algorithm, intera ction/prediction algorithm and linear programming method in Matlab are compared, thus showing that the proposed approaches are very suitable for decomposing opt imally medium-term plans(assigned to an FAW by ERP/MRPⅡ) into short-term plan s (to be executed by FMSs in the FAW).