Research on slab discharge planning model and algorithm for hot-rolling slab-yard

Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS

Volumn 12, Issue 3, 2006, Pages 377-381

  Li, Yao Hua ^a   Wang, Wei ^a   Hu, Guo Fen ^b   Ning, Shu Shi ^a  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

^b Shanghai Baosight Software Co Ltd   (China)

Author keywords

Multi model cooperation; Particle swarm optimization; Slab discharge planning; Slab yard optimization

Indexed keywords

EXPERT SYSTEMS; GENETIC ALGORITHMS; HOT ROLLING; MATHEMATICAL MODELS; OPTIMIZATION; PRODUCTION; SCHEDULING;

DISCRETE PARTICLE SWARM OPTIMIZATION (DPSO) ALGORITHM; MULTIMODEL COOPERATION; PARTICLE SWARM OPTIMIZATION; SLAB DISCHARGE PLANNING; SLAB PILE; SLAB YARD OPTIMIZATION;

PLANNING;

EID: 33744965917     PISSN: 10065911     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. ZHU Baolin, YU Haibin. Production scheduling model and algorithm for steelmaking-continuous casting-hot rolling processes[J]. Computer Integrated Manufacturing Systems, 2003, 9(1): 33-36 (in Chinese).
2. LOPEZ L, CARTER M W, GENDREAU M. The hot strip mill production scheduling problem: a tabu search approach[J]. European Journal of Operational Research, 1998, 106(2/3): 317-335.
3. LI Sujian, CHEN Zonghai. Optimal model on slab discharge planning form slab-yard in Baosteel[J]. Logistics Technology, 1996, (1), 18-21 (in Chinese).
4. TANG Lixin, YANG Zihou. Integer programming model and modified genetic algorithm for optimal turned-out slab pile for hot rolling schedule[J]. Acta Automatica Sinica, 2000, 26(4): 461-469 (in Chinese).
5. JAMES K, RUSSELL E. Particle swarm optimization[A]. IEEE International Conference on Neural Networks[C]. USA: IEEE Press, 1995. 1942-1948.
6. LI Aiguo, QIN Zheng, BAO fumin, et al. Particle swarm optimization algorithms[J]. Computer Engineering and Application, 2002, 37(21): 1-4 (in Chinese).
7. HUANG Lan, WANG Kangping, ZHOU Chunguang, et al. Particle swarm optimization for traveling salesman problems[J]. Journal of Jilin University (Science Edition), 2003, 41(3): 477-480 (in Chinese).