Abstract: Aiming at the processing and assembling characteristics in discrete manufacturing factories,a dynamic critical paths algorithm based on production flow network was proposed by combining the integration demands of material requirements plans and operation plans.According to the operation sequence and assembly structure,the production process of orders within the planning period was viewed as a production flow network.The material requirements plan was mapped into points to make the production capacity control and assembly processing constraint.The object model was programmed based on network graph of production process.According to the order delivery,the workshop operation planning and resource allocation was confirmed by searching the critical paths in network graph dynamically.The case of an operation planning in a mechanical processing workshop of a seal factory showed that the proposed algorithm could program the high effective operation plan under the finite production capacity constraints and keep the consistency of the operation plan and material requirements plan.

Key words: discrete manufacturing, operation planning, production flow networks, dynamic critical paths algorithm

摘要： 针对单件小批生产加工装配式制造的特点,结合车间作业计划与物料需求计划的集成化管控需求,提出了基于生产过程网络图的动态关键路径作业计划编制算法。算法按照零部件加工装配过程中的工艺顺序和装配关系,将计划期内订单的形成过程抽象化为生产过程网络图,并将物料需求计划映射为网络图中的节点,进行生产能力控制和加工装配约束。以生产过程网络图为作业计划编制的对象模型,以订单的交货期为依据,采用倒排的方式,通过动态寻找网络图中的关键路径来确定车间作业计划顺序和资源分配。通过某密封产品生产企业机加车间生产计划编制的实例,证明了该算法能快速有效地在有限生产能力条件下编制高效可行的车间作业计划,保证作业计划与物料需求计划的一致性。

关键词: 离散制造, 作业计划, 生产过程网络图, 动态关键路径法