活动长度有限制的多工序批量加工生产计划研究

Campaign Planning for Multi-stage Batch Processes with Limited Campaign Length

当前的化工制造中,有很多工厂使用柔性制造设备,并采用批生产模式来组织生产。由于对设备进行准备和清理的成本比较大,加工的排序一般采用多批次加工同一种产品的活动(campaign)模式。在实际的生产中,由于需要保证产品质量和减少库存,应该考虑限制活动的最大长度。本文针对活动长度有限制的多工序批量加工问题进行研究,利用状态-任务-网络概念和层级模型方法,提出了修正的活动计划模型。该模型是基于混合整数线性规划模型,并且以供应网络内总生产成本和物流成本最小化作为目标函数。最后用一个算例来说明所构建模型的有效性。

In today＇s manufacturing systems of chemical industry, there are many plants equipped with the multi-purpose equipments and operated in hatch mode. Because the set-up and clean costs are considerable, processes are scheduled in campaign mode, i.e. a number of hatches of the same type are processed in sequence. Because of purity, quality and inventory requirements of the products to be produced, it should be considered that a campaign has the limitation of maximal length in real industrial production. In this paper, a mixed-integer linear programming （MILP） model of campaign planning for multi-stage hatch processes with limited campaign length is developed, which is based on the state-task-network （STN） concept and the hierarchical modeling approach employed. Minimizing total production and logistic costs within the supply network is considered as the objective function. An example is given to show the effectiveness of the proposed model.