钢铁企业订单动态交货期承诺模型与算法

摘要

To effectively response to the dynamic market, an iron-steel enterprise operates in the make-to-order ( MTO) mode. Because of the dynamic features in such a mode, it is a challenge to make delivery date promise. In this paper, this problem is formulates as a dynamic constraint satisfaction problem. In this model, it takes the production capacity and the cost of earliness and tardiness into account. Due to the NP-hardness of the problem, a heuristic is proposed to solve the problem by taking the advantage of constraint satisfaction consistency. An industrial case problem from a steel plant is presented to show the application of the proposed approach. Result shows that it can find a good solution and meanwhile it is computationally efficient.%针对钢铁企业交货期承诺问题的动态特征,建立了动态约束满足模型.该模型综合考虑了设备利用率和订单的提前拖期惩罚.模型求解属于NP-hard问题,很难用精确算法在可行时间内求解的特点,因此结合启发式规则和约束满足一致性技术的优点,提出了求解该问题的算法.通过实验验证了模型及算法的可行性和有效性.