摘要
研究了钢铁企业板坯库的板坯倒垛(Slabstack shuffling,SSS)问题.与以往研究倒垛问题不同,考虑了板坯存储各库区吊机能力的实际限制.对该问题通过考虑实际约束,以总倒垛次数最小为目标函数建立了非线性整数规划模型.基于对问题特征的分析,分别针对轧制项目间是否存在共同可选板坯的两种情况,将模型变换为线性整数规划模型.另外,利用提出的问题性质,降低了模型的求解复杂性.实验结果表明,对于实际的问题规模,基于该线性整数规划模型的优化方法能有效地求得问题的最优解.
This paper studies the slab stack shuffling （SSS） problem in the slab yard of iron and steel industry. Different from the existing researches, it considers a new practical requirement, the crane capacity limit of each storage area. The problem is formulated into a nonlinear integer programming model through considering the practical constraints with the objective of minimizing the total shuffle number. Based on analysis on its feature, the model is transformed into linear integer programming models under both situations： whether different rolling items can share common candidate slabs or not. Furthermore, several properties are deduced for the problem to decrease the computational complexity of the models. The experiment results show that the optimization method, based on the proposed linear integer programming models, can obtain the optimal solution for practical scaled problems.
出处
《自动化学报》
EI
CSCD
北大核心
2010年第4期586-592,共7页
Acta Automatica Sinica
基金
国家高技术研究发展计划(863计划)(2006AA04Z174)
国家自然科学基金(60674084)
国家杰出青年科学基金(70425003)资助~~
关键词
钢铁企业
生产调度
板坯倒垛
线性整数规划
最优解
Iron and steel industry, production scheduling, slab stack shuffling （SSS）, linear integer programming, optimal solution
