Scheduling Algorithm Comparative Study on Mixed-Flow Blending Production System with JSSP

Abstract

The research on JSSP (Job Shop Scheduling Problem) has a long history and some achievements have reached the application level, while the study on mixed-flow blending production system is still in its infancy. In order to tell the unique characteristics of mixed-flow blending production system, an algorithm comparative experimental study was carried out in this research. Firstly, the mathematical model of mixed-flow blending production system is established, which shows the unique constraints caused by process separation and crossover, compared with JSSP model. Then, the JSSP and mixed-flow blending production system with the same size and similar related structure are solved, using compound method, penalty function method, algorithm based on topological ordering and manual scheduling method, respectively. These comparative algorithm experiments demonstrate the unique properties of mixed-flow blending production system.