Optimization for batch scheduling problem based on mould capability

On the basis of the practical production situation in a Chinese aluminum enterprise, this paper abstracts the aluminum production lot sizing and scheduling as a batch scheduling problem. We consider the jobs with different weights processed on the parallel batch machines, and the job processing is under the constraint of mould capability, besides, the numbers of batches and jobs depend on the number and capability of the moulds. This paper establishes the batch scheduling model, of which the objective function is to minimize the sum of total completion time. The optimal solution properties are analyzed, and a heuristic algorithm is designed to solve the problem. In the end the real production data is selected to make simulation, and the algorithm effectiveness is illustrated.