DocumentCode
381154
Title
Formulating the steel scheduling problem as a TSPTW
Author
Xiong, Chen ; Qidi, Wu
Author_Institution
Dept. of Electr. Eng., Fudan Univ., Shanghai, China
Volume
3
fYear
2002
fDate
2002
Firstpage
1744
Abstract
In this paper, a traveling salesman problem with time windows (TSPTW) of combinational optimization is adopted to analyse and model the problem of optimal steel production sequencing through the milling process of a large manufacturing facility. An algorithm based on a genetic algorithm is proposed for obtaining a sub-optimal production sequence of the slabs. The effectiveness of the algorithm is shown by examining numerical results.
Keywords
genetic algorithms; machining; production control; scheduling; steel industry; steel manufacture; travelling salesman problems; TSPTW; genetic algorithm; large manufacturing facility; milling process; optimal steel production sequencing; optimization; steel scheduling problem; sub-optimal production sequence; traveling salesman problem with time windows; Coils; Genetic algorithms; Job shop scheduling; Metals industry; Milling machines; Production; Slabs; Steel; Strips; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Control and Automation, 2002. Proceedings of the 4th World Congress on
Print_ISBN
0-7803-7268-9
Type
conf
DOI
10.1109/WCICA.2002.1021381
Filename
1021381
Link To Document