Abstract
The integrated charge planning (ICP) problem based on flexible jobs in an integrated steel plant is extremely difficult and valuable. The purpose of this paper is to improve the efficiency and feasibility of planning by minimising the number of charges, minimising the total production costs and maximising the total throughput, considering the hard constraints and soft constraints. A multi-objective mathematical programming model for the problem is formulated, and it is shown that the problem is NP-hard. Two new meta-heuristics are designed, one is guided variable neighbourhood search (GVNS) combined with harmony search, and the other is GVNS combined with simulated annealing. Compared with enumeration algorithm, tabu search, variable neighbourhood search (VNS), harmony search, extend next fit decreasing (ENFD) and skewed VNS (SVNS), variable neighbourhood descent (VND), the numerical results by actual production data have shown that the proposed model and GVNHS are feasible and effective for ICP.

This publication has 30 references indexed in Scilit: