Application of Square Matrix Set Type Full Arrangement Optimization Method in Pipeline Job Scheduling

There have been many research results in the real number field of the pipeline job scheduling problem, but there are few in the quasi-field. Therefore, based on the basic axiom model of the maximal quasi-field, the pipeline job queue is abstracted into n m-dimensional square matrices, and the principle of combinatorial optimization is applied to design a heuristic algorithm to solve an optimal arrangement of the square matrix, so as to obtain a optimal solution. The experimental data shows that the calculation process of the solution is simple, which provides a new idea for balancing the calculation efficiency and the quality of the solution in large-scale data analysis.