Models and Algorithms of Production Scheduling in Tandem Cold Rolling

在冷滚动的线安排问题的生产的复杂性被分析，也就是，它作为二部分被提出合并卷的优化和计划的滚动的批。钢卷合并的优化作为包装被一个新建议算法计算的问题(MCPP ) 的一只多重集装箱被构造，分离微分进化(DDE ) ，在这篇论文。一个特定的双旅行售货员问题(DTSP ) 为卷批根据进化机制计划，和一个混合启发式的方法被建模，本地搜索被介绍解决这个模型。有从安排方法的生产在这建议了纸是有效的上海 Baosteel 公司有限公司表演的真实生产数据的试验性的结果。

The complexity of production scheduling problem in cold rolling line is analyzed, which is formulated as two parts, namely, the coil-merging optimization and the rolling batch planning. The optimization of steel coil merging is constructed as a multiple container packing problem （MCPP） that is computed by a new proposed algorithm, discrete differential evolution （DDE）, in this paper. A specific double traveling salesman problem （DTSP） is modeled for the rolling batch planning, and a hybrid heuristic method on the basis of evolutionary mechanism and local search is presented to solve this model. The experimental results with real production data from Shanghai Baosteel Co. Ltd. show that the production scheduling method suggested in this paper is effective.