Order Batching Optimization Model and Algorithm for Copper Ingot Production

Using the similarity of order grades and specifications to batch multi-species and small-lot customer orders into high-volume production orders is one of the effective ways to solve the contradiction between customer demand for multi-species and small-lot copper products and high-volume production methods. The order batching problem is abstracted into a bin-packing problem with due-date constraints, an integer programming model is established, the concept of dominant and subordinate orders is introduced to eliminate symmetry, and the due-date constraints are eliminated from the constraints by data pre-processing, thus reducing the difficulty of solving the model. A heuristic algorithm based on dynamic programming is designed to solve the model by adding the concept of dynamic maximum corps. The correctness of the model and the effectiveness of the algorithm are verified by computational experiments.