关键词: 钢铁企业, 短期生产能力计划, 约束规划, 网络能力, 算法

Abstract: According to characteristics of process production in steel plant, a constraint satisfaction model for short-term production capacity planning was established based on constraints of finite production capacity, inventory and technology process. As the Constraint Programming(CP)may fall into an endless backtracking when the problem's scale was large and difficult to find feasible solutions, a constraint-based network production capacity calculation method was proposed. The pretreatment on available capacity of order/product's production network was obtained by using this method, and this capacity was considered as a constraint aided CP to cut the searching space, thus the solution was found in short time to do ability commitment and production scheduling of order/product. The experimential results showed that the complexity of algorithm was in a linear growth with the increasing of problem's scale, and the algorithm could be generally applied in various modes of production.

Key words: iron and steel plants, short term production capacity planning, constraint programming, network capacity, algorithms