A hybrid particle swarm optimisation for flexible casting job shop scheduling problem with batch processing machine

A flexible casting job shop scheduling problem (FCJSP) with batch processing machines is proposed based on the analysis of the flexible job shop scheduling problem (FJSP) and the study of the expendable casting process. Considering the makespan under the influence of the energy consumption, the authors apply the time execution window to the FCJSP model in conjunction with the characteristics of casting production. A hybrid particle swarm optimisation algorithm (HPSO) is developed to solve the FCJSP. The HPSO employs a block integration decoding rule to address scheduling integration. Particle swarm optimisation is used for global search, employing both discrete and continuous search strategies. Furthermore, the local search employs tabu search with neighbourhood operations based on knowledge-driven techniques. Simulation experiments demonstrate the feasibility of the proposed optimisation model. In the end, the HPSO algorithm has been successfully applied to the real expendable casting scheduling. The results demonstrate that it is more efficient and robust than previously reported algorithms.