Optimization Algorithm for Batch Planning with the Information of Billet Inventory

 A steel tube batch plan problem based on inventory information is studied. For the problem, a batch planning model is established with the objective of minimizing the billet shuffles. Combined with the feature of the problem, a twostage optimization algorithm based on the billet continuous shuffling is designed: first, determining the current optimal billet and searching the billets in the lower floor on the same stock to match the best continuous rolling billet; second, improving the first stage solution for searching the continuous rolling billets in each rolling location. Through experimental verification based on the actual production data, the billet shuffles decrease significantly relative to the classic heuristic algorithm. The model and algorithm are proved feasible and effective.