Model and Algorithm of Blank Design of Seamless Steel Tube for Interval Billet Size

Due to the discreteness of value in the domain and the minimum batch limit, blank design of seamless steel tube is a new problem, which is also an NP hard problem. To describe the problem, an integer programming model is established. Then, according to the features of the problem, a two-stage algorithm named MRS-MTAGH, which is based on greedy strategy and matrix transformations, is proposed to solve the problem. Finally, a simple example is tested to prove the algorithm is effective and efficient.