A two-stage scheduling method for hot rolling and its application

被引：33

作者：

Zhao, Jun ^{[1
]}

Wang, Wei ^{[1
]}

Liu, Quanli ^{[1
]}

Wang, Zhigang ^{[1
]}

Shi, Peng ^{[2
]}

机构：

[1] Dalian Univ Technol, Res Ctr Informat & Control, Dalian 116024, Peoples R China

[2] Univ Glamorgan, Dept Comp & Math Sci, Pontypridd CF37 1DL, M Glam, Wales

来源：

CONTROL ENGINEERING PRACTICE | 2009年 / 17卷 / 06期

基金：

中国国家自然科学基金;

关键词：

Hot rolling production scheduling; Vehicle routing problem with time windows; Heuristics; Intelligent search algorithms; TRAVELING SALESMAN PROBLEM; VEHICLE-ROUTING PROBLEM; STEEL PRODUCTION; TIME WINDOWS; ALGORITHM;

D O I：

10.1016/j.conengprac.2008.10.014

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Hot rolling scheduling is a difficult problem in the steel processing industry. It involves many objectives and constraints in both technical and practical respects. A two-stage scheduling method is proposed in this paper. Batch planning of staple material is formulated as a VRPTW, which is solved with a modified PGA. Then, batches of the established units are optimized by adjusting rolling sequences using intelligent search algorithms to reach higher hot charge ratios. This method has been applied to a hot strip mill belonging to Baosteel in China. Our results demonstrate that the proposed technique can improve production efficiency and offer significant economic benefits. (C) 2008 Elsevier Ltd. All rights reserved.

引用

页码：629 / 641

页数：13

共 16 条

[1] Steel production schedule generation
Assaf, I
Chen, M
Katzberg, J
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1997, 35 (02) : 467 - 477
[2] BAKER AB, 1995, J ARTIFICIAL INTELLI
[3] A flexible decision support system for steel hot rolling mill scheduling
Cowling, P
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2003, 45 (02) : 307 - 321
[4] A NEW OPTIMIZATION ALGORITHM FOR THE VEHICLE-ROUTING PROBLEM WITH TIME WINDOWS
DESROCHERS, M
DESROSIERS, J
SOLOMON, M
[J]. OPERATIONS RESEARCH, 1992, 40 (02) : 342 - 354
[5] Homberger J, 1999, INFOR, V37, P297
[6] KATAYAMA K, 2001, P C EV COMP SEOUL
[7] Supporting rescheduling using CSP, RMS and POB - an example application
Kelleher, G
Cavichiollo, P
[J]. JOURNAL OF INTELLIGENT MANUFACTURING, 2001, 12 (04) : 343 - 357
[8] DISCRETE EVENT SEQUENCING AS A TRAVELING SALESMAN PROBLEM
KOSIBA, ED
WRIGHT, JR
COBBS, AE
[J]. COMPUTERS IN INDUSTRY, 1992, 19 (03) : 317 - 327
[9] The hot strip mill production scheduling problem: A tabu search approach
Lopez, L
Carter, MW
Gendreau, M
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (2-3) : 317 - 335
[10] MINIMIZING CONFLICTS - A HEURISTIC REPAIR METHOD FOR CONSTRAINT SATISFACTION AND SCHEDULING PROBLEMS
MINTON, S
JOHNSTON, MD
PHILIPS, AB
LAIRD, P
[J]. ARTIFICIAL INTELLIGENCE, 1992, 58 (1-3) : 161 - 205

← 1 2 →