Formulating the steel scheduling problem as a TSPTW

摘要

In this paper, a traveling salesman problem with time windows (TSPTW) of combinational optimization is adopted to analyses and model the problem of an optimal steel production sequencing through the milling process of a large manufacture facility. An algorithm based on 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.