【作者】 朱俊；

【导师】 杜斌；

【作者基本信息】 上海交通大学 ， 控制理论与控制工程， 2007， 硕士

【摘要】 生产计划和调度问题是伴随制造企业整个生产管理过程的最重要的问题之一,是衡量企业竞争力的重要指标。钢铁企业生产中的很多生产计划和调度问题,这些问题都可以归结为组合优化问题,如炼钢调度,连铸计划,热轧计划,物流平衡,运输调度,一体化生产调度等。组合优化问题是NP-Hard问题,而这类问题是无法使用传统的优化方法在有限时间内获得最优解的,必须借助启发式算法或其他智能算法。热轧是钢铁企业三大关键工序炼钢、连铸、热轧之一。热轧计划编制是钢铁生产中一个重要环节,是一个组合优化问题。热轧计划的编制不仅关系到热轧生产,还关系到炼钢、连铸生产的进行。早期,计划员采用手工方式进行计划编制,由于人力的局限性,计划员通过手工方式来编制计划的速度比较慢,编制出的计划效果往往不是很好,甚至较差。而如今国际上先进的钢铁企业大都采用模型的方式进行计划编制,这种方式能同时编制出多个计划,且编制速度快,效果好。文章研究了宝钢热轧计划编制的实际问题,分析了宝钢热轧计划的相关规程约束,建立了计划编制MTSP模型,并在此基础上给出了求解该问题的有效的智能优化算法-遗传模拟退火算法。论文描述了宝钢自动化所在热轧计划优化编制问题上开发的应用系统,该系统成功地解决了热轧计划的自动编制问题,并取得了突出的效果:提高了工作效率、减少了劳动强度提高了计划的合理性与科学性满足产量均衡,提高流量命中率,轧棍利用率提高热送热装率,从而大大降低成本,提高了效益更多还原

【Abstract】 Production Planning and Scheduling, which evaluate the competence of the company, is one of the most important problems in Manufacturing Enterprise. There are many Planning and Scheduling problems in Steel Manufacturing Enterprise, such as Steel-making Scheduling, Continuous-Casting Planning, Hot Rolling Planning, Logistics Balancing, Transport Scheduling and Integrated Production Scheduling. All these problems can be ranked as combinatorial optimization problems. Combinatorial optimization problems are always NP-hard problems. It’s difficult to solve these problems in acceptable time, using traditional optimization methods. But there are still some rapid methods, which are described as intelligent optimization algorithms, help us to get acceptable solution in much more shorter time.Steel-making, Continuous Casting, Hot Rolling are the three important working procedure in Steel Manufacturing Enterprise. Hot Rolling planning is an important activity. It’s an combinatorial optimization problem. Hot Rolling plan is not only tightened related to Hot Rolling, but also related to Steel-making, Continuous Casting and many other activities. Schedulers built Hot Rolling Plan by hands formerly. But it always took long time for them to build only one not good plan. Nowadays, advanced steel companies in the world are all using modeling techniques to solve their problem. By this way, they can build more and better plans in much shorter time.The paper studied the Hot Rolling Planning problem of BaoSteel. After thoroughly studied the constraint of BaoSteel’s Hot Rolling activity, we set up a plan making model, which actually can be classified as a MTSP model. And then we give a intelligent optimization algorithm, which we called Genetic Simulate Annealing Algorithm, to solve the model.更多还原